#include using namespace std; #define rep(i,x,y) for(int i=x;i>N; string s;cin>>s; int E[N+1];E[0]=0; rep(i,1,N+1){ if(s[i-1]=='E') E[i]=E[i-1]+1; else E[i]=E[i-1]; } long A[N+1][N+1];A[0][0]=0; long a; rep(i,1,N+1){ cin>>a; A[0][i]=A[0][i-1]+a; }rep(i,1,N+1)rep(j,0,N+1-i){ A[i][j]=A[0][i+j]-A[0][i]; } //pprint(A,N+1,N+1); int Q;long k; cin>>Q; rep(i,0,Q){ cin>>k; int res=0;int id; rep(j,0,N+1){ id=upper_bound(A[j],A[j]+N+1-j,k)-1-A[j]; res=max(res,E[j+id]-E[j]); }cout<