#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());


#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const ll mod = (119 << 23) + 1, root = 62; // = 998244353
// For p < 2^30 there is also e.g. 5 << 25, 7 << 26, 479 << 21
// and 483 << 21 (same root). The last two are > 10^9.
typedef vector<ll> vl;


ll modpow(ll b, ll e) {
	ll ans = 1;
	for (; e; b = b * b % mod, e /= 2)
		if (e & 1) ans = ans * b % mod;
	return ans;
}

void ntt(vl &a) {
	int n = sz(a), L = 31 - __builtin_clz(n);
	static vl rt(2, 1);
	for (static int k = 2, s = 2; k < n; k *= 2, s++) {
		rt.resize(n);
		ll z[] = {1, modpow(root, mod >> s)};
		rep(i,k,2*k) rt[i] = rt[i / 2] * z[i & 1] % mod;
	}
	vi rev(n);
	rep(i,0,n) rev[i] = (rev[i / 2] | (i & 1) << L) / 2;
	rep(i,0,n) if (i < rev[i]) swap(a[i], a[rev[i]]);
	for (int k = 1; k < n; k *= 2)
		for (int i = 0; i < n; i += 2 * k) rep(j,0,k) {
			ll z = rt[j + k] * a[i + j + k] % mod, &ai = a[i + j];
			a[i + j + k] = ai - z + (z > ai ? mod : 0);
			ai += (ai + z >= mod ? z - mod : z);
		}
}
vl conv(const vl &a, const vl &b) {
	if (a.empty() || b.empty()) return {};
	int s = sz(a) + sz(b) - 1, B = 32 - __builtin_clz(s), n = 1 << B;
	int inv = modpow(n, mod - 2);
	vl L(a), R(b), out(n);
	L.resize(n), R.resize(n);
	ntt(L), ntt(R);
	rep(i,0,n) out[-i & (n - 1)] = (ll)L[i] * R[i] % mod * inv % mod;
	ntt(out);
	return {out.begin(), out.begin() + s};
}

int n , m ;
vl a , b ;
vl hh1 , hh2 , hh3 , hh4 ;
ll enc[ 50 ] ;
const int MAXN = 4e5 + 7 ;
bool good[ MAXN ] ;

void solve ( ) {
    cin >> n >> m ;
    a.resize ( n ) , b.resize ( m ) ;
    for ( int i = 0 ; i + ( m - 1 ) < n ; ++ i ) {
        good[ i ] = true ;
    }
    auto ord = [ & ] ( char c ) {
        if ( c == 'n' ) { return 0 ; }
        if ( c == 'w' ) { return 1 ; }
        if ( c == 's' ) { return 2 ; }
        if ( c == 'e' ) { return 3 ; }
    };
    for ( int i = 0 ; i < n ; ++ i ) {
        char c ; int x ;
        cin >> c ;
        if ( c == '?' ) { a[ i ] = 0 ; continue ; }
        cin >> x ;
        a[ i ] = ord ( c ) * 8 + x ;
    }
    for ( int i = 0 ; i < m ; ++ i ) {
        char c ; int x ;
        cin >> c ;
        if ( c == '?' ) { b[ i ] = 0 ; continue ; }
        cin >> x ;
        b[ i ] = ord ( c ) * 8 + x ;
    }
    reverse ( b.begin ( ) , b.end ( ) ) ;
    for ( int ctr = 0 ; ctr < 2 ; ++ ctr ) {
        for ( int i = 1 ; i < 50 ; ++ i ) {
            enc[ i ] = rng ( ) % mod + 1 ;
        }

        hh1.resize ( n ) , hh2.resize ( m ) ;
        for ( int i = 0 ; i < n ; ++ i ) {
            hh1[ i ] = ( enc[ a[ i ] ] * enc[ a[ i ] ] ) % mod ;
        }
        for ( int i = 0 ; i < m ; ++ i ) {
            hh2[ i ] = ( i + 1 ) * enc[ b[ i ] ] % mod ;
        }
        auto ret1 = conv ( hh1 , hh2 ) ;

        hh3.resize ( n ) , hh4.resize ( m ) ;
        for ( int i = 0 ; i < n ; ++ i ) {
            hh3[ i ] = enc[ a[ i ] ] ;
        }
        for ( int i = 0 ; i < m ; ++ i ) {
            hh4[ i ] = ( i + 1 ) * ( ( enc[ b[ i ] ] * enc[ b[ i ] ] ) % mod ) % mod ;
        }
        auto ret2 = conv ( hh3 , hh4 ) ;
        for ( int i = 0 ; i + m - 1 < n ; ++ i ) {
            if ( ( ret1[ i + ( m - 1 ) ] - ret2[ i + ( m - 1 ) ] + mod ) % mod != 0 ) {
                good[ i ] = false ;
            }
        }
    }
    int ans = 0 ;
    for ( int i = 0 ; i + m - 1 < n ; ++ i ) {
        ans += good[ i ] ;
    }
    cout << ans << "\n" ;
}


int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}