#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define pii pair<int,int>
#define vi vector<int>
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define ll long long
using namespace std;
inline ll read(){
    ll x=0,f=1;char ch=getchar();
    while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
    while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
    return x*f;
}
const int N=2e5+5;
int n,K,dx,dy,x[N],y[N];
ll ans;
char s[N];
void Move(char c){
    if(c=='N')dy++;
    else if(c=='S')dy--;
    else if(c=='E')dx++;
    else if(c=='W')dx--;
}
set <pii> S;
int calc(){//暴力
    int ans=0;
    for(auto t:S){
        int x=t.fi,y=t.se;
        if(S.count({x+1,y})&&S.count({x,y+1})&&S.count({x+1,y+1}))ans++;
    }
    return ans;
}
map <pii,vi> mp;
vector <pii> Merge(vector <pii> A,vector <pii> B){
    vector <pii> V;
    int i=0,j=0;
    while(i<A.size()&&j<B.size()){
        int l=max(A[i].fi,B[j].fi);
        int r=min(A[i].se,B[j].se);
        if(l<=r)V.emplace_back(l,r);
        A[i].se<B[j].se?i++:j++;
    }
    return V;
}
int main(){
    n=read(),K=read();
    scanf("%s",s+1);
    rep(i,1,n){
        Move(s[i]);
        x[i]=dx,y[i]=dy;
    }
    if(!dx&&!dy){
        rep(i,0,n){
            S.emplace(x[i],y[i]);
        }
        printf("%d\n",calc());
        return 0;
    }
    if(dx<0){
        rep(i,0,n)x[i]=-x[i];
        dx=-dx;
    }
    if(dy<0){
        rep(i,0,n)y[i]=-y[i];
        dy=-dy;
    }
    if(!dx){
        swap(dx,dy);
        rep(i,0,n)swap(x[i],y[i]);
    }
    rep(i,0,n){
        int t=x[i]/dx;
        if(x[i]<0&&x[i]%dx)t--;
        mp[{x[i]-t*dx,y[i]-t*dy}].pb(t);
    }
    for(auto &p:mp)sort(p.se.begin(),p.se.end());
    for(auto &p:mp){
        int x=p.fi.fi,y=p.fi.se;
        vi d(4),V[4];
        bool flg=1;
        rep(i,0,3){
            int nx=x+(i>>1),ny=y+(i&1);
            if(nx==dx)nx-=dx,ny-=dy,d[i]--;
            if(mp.count({nx,ny}))V[i]=mp[{nx,ny}];
            else{flg=0;break;}
        }
        if(!flg)continue;
        vector <pii> T;
        rep(i,0,3){
            vector <pii> tmp;
            int l=INT_MIN,r;
            for(int x:V[i]){
                int L=x+d[i],R=L+K-1;
                if(l==INT_MIN)l=L,r=R;
                else if(L<=r+1)r=max(r,R);
                else tmp.emplace_back(l,r),l=L,r=R;
            }
            tmp.emplace_back(l,r);
            if(i==0)T=tmp;
            else T=Merge(T,tmp);
        }
        for(auto t:T)ans+=t.se-t.fi+1;
    }
    printf("%lld\n",ans);
    return 0;
}