#include<bits/stdc++.h>
#include<bits/extc++.h>
using namespace std;
#define gmap __gnu_pbds::cc_hash_table
char s[100005];
int X[100005],Y[100005];
#define M 1000000
inline long long mk(int x,int y){
	return 1ll*(x+M)*M+y;
}
void output(vector<int>v){
	puts("###");
	for(auto cu:v)printf("%d ",cu);
	printf("\n");
}
vector<int>g[200005];
vector<pair<int,int>>vc[200005];
int sz[200005];
int main(){
	int n,k;
	scanf("%d%d",&n,&k);
	scanf("%s",s+1);
	X[0]=Y[0]=0;
	for(int i=1;i<=n;++i){
		X[i]=X[i-1],Y[i]=Y[i-1];
		if(s[i]=='N')++Y[i];
		if(s[i]=='S')--Y[i];
		if(s[i]=='E')++X[i];
		if(s[i]=='W')--X[i];
	}
	int rx=X[n],ry=Y[n];
	if(rx<0){
		rx=-rx;
		for(int i=0;i<=n;++i)X[i]*=-1;
	}
	if(ry<0){
		ry=-ry;
		for(int i=0;i<=n;++i)Y[i]*=-1;
	}
	int mnx=1e9,mny=1e9;
	for(int i=0;i<=n;++i)mnx=min(mnx,X[i]),mny=min(mny,Y[i]);
	for(int i=0;i<=n;++i)X[i]-=mnx,Y[i]-=mny;
	if((rx==0&&ry==0)||(k==1)){
		gmap<long long,int>mp;
		for(int i=0;i<=n;++i)mp[1ll*X[i]*(n+1)+Y[i]]=1;
		int ans=0;
		auto mpp=mp;
		for(auto pi:mpp){
			int x=pi.first/(n+1),y=pi.first%(n+1);
			if(mp[1ll*(x+1)*(n+1)+y]&&mp[1ll*(x+1)*(n+1)+(y+1)]){
				if(mp[1ll*x*(n+1)+(y+1)])++ans;
			}
		}
		printf("%d\n",ans);
		return 0;
	}
	if(rx>ry){
		swap(rx,ry);
		for(int i=0;i<=n;++i)swap(X[i],Y[i]);
	}
	map<long long,int>mp;
	int tt=0;
	for(int i=0;i<=n;++i){
		int gy=Y[i]/ry,my=Y[i]%ry;
		int mx=X[i]-gy*rx;
		long long wz=mk(mx,my);
		if(!mp[wz])mp[wz]=++tt;
		g[mp[wz]].emplace_back(gy+1);
	}
	auto pm=mp;
	for(int i=0;i<=n;++i){
		int gy=Y[i]/ry,my=Y[i]%ry;
		int mx=X[i]-gy*rx;
		if(!my){
			long long zw=mk(mx+rx,my+ry);
			if(!mp[zw])mp[zw]=++tt;
			g[mp[zw]].emplace_back(gy);
		}
	}
	for(int i=1;i<=tt;++i){
		sort(g[i].begin(),g[i].end());
		g[i].resize(unique(g[i].begin(),g[i].end())-g[i].begin());
		sz[i]=g[i].size();
		int L=0,R=0;
		for(int j=0;j<sz[i];++j){
			if(j==0||g[i][j]+1>R){
				if(j)vc[i].emplace_back(L,R);
				L=g[i][j]+1,R=g[i][j]+k;
			}else{
				R=g[i][j]+k;
			}
		}
		vc[i].emplace_back(L,R);
	}
	long long ans=0;
	for(auto pi:pm){
		int x=pi.first/M-M,y=pi.first%M;
		long long wa=mk(x,y),wb=mk(x+1,y);
		long long wc=mk(x,y+1),wd=mk(x+1,y+1);
		if(mp.find(wa)==mp.end())continue;
		if(mp.find(wb)==mp.end())continue;
		if(mp.find(wc)==mp.end())continue;
		if(mp.find(wd)==mp.end())continue;
		int A=mp[wa],B=mp[wb],C=mp[wc],D=mp[wd];
		int sa=vc[A].size(),sb=vc[B].size(),sc=vc[C].size(),sd=vc[D].size();
		int za=0,zb=0,zc=0,zd=0;
		while(za<sa&&zb<sb&&zc<sc&&zd<sd){
			int la=vc[A][za].first,ra=vc[A][za].second;
			int lb=vc[B][zb].first,rb=vc[B][zb].second;
			int lc=vc[C][zc].first,rc=vc[C][zc].second;
			int ld=vc[D][zd].first,rd=vc[D][zd].second;
			int l=max(max(la,lb),max(lc,ld));
			int r=min(min(ra,rb),min(rc,rd));
			ans+=max(0,r-l+1);
			if(ra==r)++za;
			else if(rb==r)++zb;
			else if(rc==r)++zc;
			else ++zd;
		}
	}
	printf("%lld\n",ans);
	return 0;
}