#pragma comment(linker, "/STACK:1024000000,1024000000")

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<vector>

#include<map>

#include<set>

#include<queue>

#include<stack>

#include<bitset>

#include<iostream>

using namespace std;

typedef long long LL;

const double pi=acos(-1.0),eps=1e-;

void File()

{

    freopen("D:\\in.txt","r",stdin);

    freopen("D:\\out.txt","w",stdout);

}

template <class T>

inline void read(T &x)

{

    char c=getchar(); x=;

    while(!isdigit(c)) c=getchar();

    while(isdigit(c)) {x=x*+c-''; c=getchar();}

}

const int maxn=;

struct X { LL num; int a; }s[maxn],t[maxn];

int lens,lent,n,m;

char op[];

int nx[maxn],f[maxn],g[maxn];

LL a[maxn],b[maxn]; int len1,len2;

void get_next()

{

    int j=-,i=; nx[]=-;

    while(i<len2)

    {

        if(j==-||b[i]==b[j]) i++, j++, nx[i]=j;

        else j=nx[j];

    }

}

void kmp(bool x){

    get_next();

    int i=,j=;

    while(i<len1){

        if(j==-||a[i]==b[j]) i++ ,j++;

        else j=nx[j];

        if(j==len2)

        {

            if(x==) f[i-j+len2]=;

            else g[i-j+len2]=;

        }

    }

}

int main()

{

    scanf("%d%d",&n,&m);

    for(int i=;i<=n;i++)

    {

        scanf("%s",op); int L=strlen(op);

        int num=,sign;

        for(int j=;j<=L-;j++) num=num*+op[j]-'';

        sign=op[L-]-'a'+;

        if(lens==||sign!=s[lens-].a) { s[lens].num=num; s[lens].a=sign; lens++; }

        else s[lens-].num+=num;

    }

    for(int i=;i<=m;i++)

    {

        scanf("%s",op); int L=strlen(op);

        int num=,sign;

        for(int j=;j<=L-;j++) num=num*+op[j]-'';

        sign=op[L-]-'a'+;

        if(lent==||sign!=t[lent-].a) { t[lent].num=num; t[lent].a=sign; lent++; }

        else t[lent-].num+=num;

    }

    if(lent==)

    {

        LL ans=;

        for(int i=;i<lens;i++)

        {

            if(s[i].a!=t[].a) continue;

            if(s[i].num<t[].num) continue;

            ans=ans+s[i].num-t[].num+;

        }

        printf("%lld\n",ans);

    }

    else if(lent==)

    {

        LL ans=;

        for(int i=;i<lens-;i++)

        {

            if(s[i].a!=t[].a||s[i+].a!=t[].a) continue;

            if(t[].num>s[i].num||t[].num>s[i+].num) continue;

            ans++;

        }

        printf("%lld\n",ans);

    }

    else

    {

        for(int i=;i<lens;i++) a[i]=s[i].a;

        for(int i=;i<lent;i++) b[i]=t[i].a;

        len1=lens,len2=lent; kmp();

        memset(a,,sizeof a); memset(b,,sizeof b);

        for(int i=;i<lens;i++) a[i]=s[i].num;

        for(int i=;i<lent-;i++) b[i-]=t[i].num;

        len1=lens; len2=lent-; kmp();

        LL ans=;

        for(int i=;i<lens;i++)

        {

            if(f[i+]==) continue;

            if(g[i]==) continue;

            if(s[i].num<t[lent-].num) continue;

            if(s[i-lent+].num<t[].num) continue;

            ans++;

        }

        printf("%lld\n",ans);

    }

    return ;

}