#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<algorithm>

using namespace std;

#define ll long long

#define N 110

char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<''||c>'')) c=getchar();return c;}

int gcd(int n,int m){return m==?n:gcd(m,n%m);}

int read()

{

    int x=,f=;char c=getchar();

    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}

    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();

    return x*f;

}

int n,a[N],s,ans=;

int calc(int k){return abs(s-a[k]*n);}

int main()

{

/*#ifndef ONLINE_JUDGE

    freopen("a.in","r",stdin);

    freopen("a.out","w",stdout);

    const char LL[]="%I64d\n";

#else

    const char LL[]="%lld\n";

#endif*/

    n=read();

    for (int i=;i<=n;i++) s+=a[i]=read();

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

    if (calc(i)<calc(ans+)) ans=i-;

    cout<<ans;

    return ;

}

#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<algorithm>

using namespace std;

#define ll long long

#define N 1010

char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<''||c>'')) c=getchar();return c;}

int gcd(int n,int m){return m==?n:gcd(m,n%m);}

int read()

{

    int x=,f=;char c=getchar();

    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}

    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();

    return x*f;

}

int n,m,b[N],cnt=;

ll a[N*N],c[N*N],ans;

int main()

{

/*#ifndef ONLINE_JUDGE

    freopen("a.in","r",stdin);

    freopen("a.out","w",stdout);

    const char LL[]="%I64d\n";

#else

    const char LL[]="%lld\n";

#endif*/

    n=read(),m=read();

    for (int i=;i<=n;i++) b[i]=read();

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

    {

        a[++cnt]=b[i];

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

        cnt++,a[cnt]=a[cnt-]+b[j];

    }

    n=cnt;

    for (int j=;~j;j--)

    {

        int s=;

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

        if (a[i]&(1ll<<j)) c[++s]=a[i];

        if (s>=m)

        {

            ans+=1ll<<j;n=s;

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

        }

    }

    cout<<ans;

    return ;

}

#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<algorithm>

using namespace std;

#define ll long long

#define N 1000010

char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<''||c>'')) c=getchar();return c;}

int gcd(int n,int m){return m==?n:gcd(m,n%m);}

int read()

{

    int x=,f=;char c=getchar();

    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}

    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();

    return x*f;

}

int n,q,m,a[N],b[N],c[N];

char s[N];

int main()

{

    n=read();scanf("%s",s+);

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

    if (s[i]=='D') a[i]=;

    else if (s[i]=='M') a[i]=;

    else if (s[i]=='C') a[i]=;

    else a[i]=-;

    q=read();

    while (q--)

    {

        m=read();

        int hb=,tb=,hc=,t=,tc=;ll ans=,cur=;

        for (int i=;i<=n;i++) if (a[i]==) b[++tb]=i;

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

        if (a[i]==) ans+=cur;

        else if (a[i]==)

        {

            c[++tc]=i;

            while (t<tb&&b[t+]-i+<=m) t++;

            cur+=t-hb+;

        }

        else if (a[i]==)

        {

            while (hc<=tc&&i-c[hc]+>m) hc++;

            cur-=tc-hc+;

            hb++;

        }

        cout<<ans<<endl;

    }

    return ;

}