#include <bits/stdc++.h>
using namespace std;


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

li n;
string s;
li q;
li k[111];

li sum_m[1001000];
li sum_c[1001000];
li sum_m_before_c[1001000];

inline li cup(li x) {
    return min(sz(s), x);
}

inline li solve(li x) {
    li res = 0;
    rep(i, sz(s)) {
        if (s[i] == 'D') {
            li num_c = sum_c[cup(i + x)] - sum_c[i];
            //p3(i, num_c, sum_m_before_c[cup(i + x)] - sum_m_before_c[i]);
            res += sum_m_before_c[cup(i + x)] - sum_m_before_c[i] - sum_m[i] * num_c;
        }
    }
    return res;
}

int main() {
    cin >> n;
    cin >> s;
    cin >> q;
    rep(i, q) {
        cin >> k[i];
    }

    li ss = sz(s);
    sum_m[0] = 0;
    sum_c[0] = 0;
    sum_m_before_c[0] = 0;
    rep(i, ss) {
        sum_m[i + 1] = sum_m[i] + (s[i] == 'M');
        sum_c[i + 1] = sum_c[i] + (s[i] == 'C');
        sum_m_before_c[i + 1] = sum_m_before_c[i];
        if (s[i] == 'C') {
            sum_m_before_c[i + 1] = sum_m_before_c[i] + sum_m[i];
        }
    }

    //dump(sum_m, ss + 1);
    //dump(sum_c, ss + 1);
    //dump(sum_m_before_c, ss + 1);

    rep(i, q) {
        cout << solve(k[i]) << endl;
    }

    return 0;
}

Measured memory_bytes: 24836