Codeforces 631D：Messenger KMP

D. Messenger

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Each employee of the "Blake Techologies" company uses a special messaging app "Blake Messenger". All the stuff likes this app and uses it constantly. However, some important futures are missing. For example, many users want to be able to search through the message history. It was already announced that the new feature will appear in the nearest update, when developers faced some troubles that only you may help them to solve.

All the messages are represented as a strings consisting of only lowercase English letters. In order to reduce the network load strings are represented in the special compressed form. Compression algorithm works as follows: string is represented as a concatenation of nblocks, each block containing only equal characters. One block may be described as a pair (li, ci), where li is the length of the i-th block and ci is the corresponding letter. Thus, the string s may be written as the sequence of pairs .

Your task is to write the program, that given two compressed string t and s finds all occurrences of s in t. Developers know that there may be many such occurrences, so they only ask you to find the number of them. Note that p is the starting position of some occurrence of s in t if and only if tptp + 1...tp + |s| - 1 = s, where ti is the i-th character of string t.

Note that the way to represent the string in compressed form may not be unique. For example string "aaaa" may be given as , , ...

Input

The first line of the input contains two integers n and m (1 ≤ n, m ≤ 200 000) — the number of blocks in the strings t and s, respectively.

The second line contains the descriptions of n parts of string t in the format "li-ci" (1 ≤ li ≤ 1 000 000) — the length of the i-th part and the corresponding lowercase English letter.

The second line contains the descriptions of m parts of string s in the format "li-ci" (1 ≤ li ≤ 1 000 000) — the length of the i-th part and the corresponding lowercase English letter.

Output

Print a single integer — the number of occurrences of s in t.

Examples

input

5 3
3-a 2-b 4-c 3-a 2-c
2-a 2-b 1-c

output

1

input

6 1
3-a 6-b 7-a 4-c 8-e 2-a
3-a

output

6

input

5 5
1-h 1-e 1-l 1-l 1-o
1-w 1-o 1-r 1-l 1-d

output

0

Note

In the first sample, t = "aaabbccccaaacc", and string s = "aabbc". The only occurrence of string s in string t starts at position p = 2.

In the second sample, t = "aaabbbbbbaaaaaaacccceeeeeeeeaa", and s = "aaa". The occurrences of s in t start at positions p = 1,p = 10, p = 11, p = 12, p = 13 and p = 14.

题意是后一个字符串出现在前一个字符串有多少次。字符串的表示方式为<x,y>...表示x个y字符。

检讨自己思路太狭窄。。。说白了还是笨。。。

KMP直接从第2个开始匹配，匹配到倒数第一个时，判断第一个和最后一个的大小关系。

代码：

#pragma warning(disable:4996)
#include <iostream>
#include <functional>
#include <algorithm>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
using namespace std;
typedef long long ll;

#define INF 0x3fffffffffffffff

const ll mod = 1e9 + 7;
const int maxn = 200005;

int nex[maxn];

struct no
{
	char c;
	ll v;
	bool operator==(const no &b)const
	{
		return (c == b.c) && (v == b.v);
	}
	bool operator<=(const no &b)const
	{
		return (c == b.c) && (v <= b.v);
	}
};

ll n, m;
no a[maxn], b[maxn];

void compress(no *a, ll &x)
{
	ll n = 1;
	int i;
	for (i = 2; i <= x; i++)
	{
		if (a[n].c == a[i].c)
		{
			a[n].v += a[i].v;
		}
		else
		{
			n++;
			a[n].v = a[i].v;
			a[n].c = a[i].c;
		}
	}
	x = n;
}

void solve()
{
	int i, j, k;
	scanf("%I64d%I64d", &n, &m);

	for (i = 1; i <= n; i++)
	{
		scanf("%I64d-%c", &a[i].v, &a[i].c);
	}
	compress(a, n);

	for (i = 1; i <= m; i++)
	{
		scanf("%I64d-%c", &b[i].v, &b[i].c);
	}
	compress(b, m);

	ll res = 0;
	if (m == 1)
	{
		for (i = 1; i <= n; i++)
		{
			if (b[1] <= a[i])
			{
				res += (a[i].v - b[1].v + 1);
			}
		}
	}
	else if (m == 2)
	{
		for (i = 2; i <= n; i++)
		{
			if (b[1] <= a[i - 1] && b[2] <= a[i])
			{
				res++;
			}
		}
	}
	else
	{
		j = 0;
		for (i = 1; i <= m;)
		{
			if (b[i] == b[j] || j == 0)
			{
				i++;
				j++;
				nex[i] = j;
			}
			else
			{
				j = nex[j];
			}
		}
		for (i = 1, j = 1; i <= n&&j <= m;)
		{
			if (b[j + 1] == a[i])
			{
				i++;
				j++;
			}
			else
			{
				if (nex[j] == 0)
				{
					j = 1;
					i++;
				}
				else
				{
					j = nex[j];
				}
			}
			if (j == m - 1)
			{
				if (b[1] <= a[i - j] && b[j + 1] <= a[i])
				{
					res++;
				}
				j = nex[j];
			}
		}
	}
	printf("%I64d", res);
}

int main()
{
#ifndef ONLINE_JUDGE  
	freopen("i.txt", "r", stdin);
	freopen("o.txt", "w", stdout);
#endif 

	solve();

	return 0;
}