#include <deque>
#include <queue>
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <tuple>
#include <string>
#include <functional>
#include <iterator>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <bitset>
#include <stack>
#include <iomanip>

using namespace std;
typedef int64_t i64;
typedef double db;
typedef vector<vector<int64_t>> mat;
typedef pair<int,int> pii;
typedef pair<int64_t,int> pli;
typedef pair<db,int> pdi;

#define esc(x) cout << (x) << endl,exit(0)
#define inf(T) (numeric_limits<T>::max() / 2 - 1)
#define each(i,v) for(auto i = begin(v),end_copy = end(v); i != end_copy; ++i)
#define reach(i,v) for(auto i = rbegin(v),rend_copy = rend(v); i != rend_copy; ++i)
#define urep(i,s,t) for(int64_t i = (s),t_copy = (t); i <= t_copy; ++i)
#define drep(i,s,t) for(int64_t i = (s),t_copy = (t); i >= t_copy; --i)
#define rep(i,n) urep(i,0,(n) - 1)
#define rep1(i,n) urep(i,1,(n))
#define rrep(i,n) drep(i,(n) - 1,0)
#define all(v) begin(v),end(v)
#define rall(v) rbegin(v),rend(v)
#define vct vector
#define prque priority_queue
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define fir first
#define sec second

template <class T, class U> ostream& operator << (ostream& s, pair<T,U> p) { return s << p.fir << " " << p.sec; }
template <class T> ostream& operator << (ostream& s, vector<T>& v) { for(auto i = v.begin(); i != v.end(); i++) { if(i != begin(v)) s << " "; s << *i; } return s; }

template <class T> void hash_combine(size_t &seed, T const &key) {
    hash<T> hasher;
    seed ^= hasher(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
namespace std {
    template <class T, class U> struct hash<pair<T,U>> {
        size_t operator()(pair<T,U> const &p) const {
            size_t seed(0);
            hash_combine(seed,p.first);
            hash_combine(seed,p.second);
            return seed;
        }
    };
    template <class T, class U, class V> struct hash<tuple<T,U,V>> {
        size_t operator()(tuple<T,U,V> const &t) const {
            size_t seed(0);
            hash_combine(seed,get<0>(t));
            hash_combine(seed,get<1>(t));
            hash_combine(seed,get<2>(t));
            return seed;
        }
    };
}

const auto add = [](auto &x, auto y) { x += y; };
const auto lam_min = [](auto x, auto y) { return min(x,y); };
const auto lam_max = [](auto x, auto y) { return max(x,y); };
bool odd(i64 x) { return x & 1; }
bool even(i64 x) { return !odd(x); }
bool parity(i64 x, i64 y) { return odd(x) ^ even(y); }
bool bit(i64 n, uint8_t e) { return n >> e & 1; }
int ilog(i64 x, uint64_t b) { if(x) return ilog(x / b,b) + 1; return -1; }
i64 qceil(i64 x, i64 y) { return x > 0 ? (x - 1) / y + 1 :  x / y; }
i64 gcd(i64 a, i64 b) { if(!b) return abs(a); if(a % b) return gcd(b, a % b); return abs(b); }
i64 lcm(i64 a, i64 b) { if(a && b) return abs(a / gcd(a, b) * b); return 0; }
i64 bins(i64 ok, i64 ng, auto judge) {
    while(abs(ok - ng) > 1) {
        i64 mid = ok + ng >> 1;
        (judge(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <class T, class U> bool chmax(T& m, U x) { if(m < x) { m = x; return 1; } return 0; }
template <class T, class U> bool chmin(T& m, U x) { if(m > x) { m = x; return 1; } return 0; }
template <class T> T cmprs(T& v) {
    T tmp = v,ret = v;
    sort(all(tmp));
    tmp.erase(unique(all(tmp)),end(tmp));
    each(i,ret) *i = l_bnd(all(tmp),*i) - begin(tmp) + 1;
    return ret;
}

const int dir[8][2] = { {1,0},{0,1},{-1,0},{0,-1},{1,1},{-1,1},{-1,-1},{1,-1} };
const i64 mod = 1e9 + 7;
const db eps = 1e-15;


void fail() {
    esc("invalid");
} 

i64 extgcd(i64 a,i64 b,i64 &x,i64 &y){
    i64 d=a;
    if(b){
        d=extgcd(b,a%b,y,x);
        y-=(a/b)*x;
    }else{
        x=1;
        y=0;
    }
    return d;
}

template <class Monoid> struct LazySegtree {
    typedef function<Monoid(const Monoid&, const Monoid&)> opr_t;
    typedef function<void(Monoid&, const Monoid&)> lazy_opr_t;
    typedef function<void(Monoid&, const Monoid&, uint)> update_opr_t;
    const opr_t opr;
    const lazy_opr_t lazy_opr;
    const update_opr_t update_opr;
    const Monoid idel,lazy_idel;
    vector<Monoid> data,lazy;
    vector<bool> lazyflag;
    int range = 1;

    LazySegtree(int n, Monoid idel_ = 0, const opr_t &opr_ = plus<Monoid>(), const lazy_opr_t &lazy_opr_ = [](Monoid &x, Monoid y){x += y;}, const update_opr_t &update_opr_ = [](Monoid &x, Monoid y, unsigned int w){x += y * w;}, Monoid lazy_idel_ = 0) : opr(opr_),lazy_opr(lazy_opr_),update_opr(update_opr_),idel(idel_),lazy_idel(lazy_idel_)
    {
        while(n >= range) range <<= 1;
        data.resize(range << 1,idel);
        lazy.assign(range << 1,lazy_idel);
        lazyflag.assign(range << 1,false);
    }

    void copy(const vector<Monoid> &v) {
        for(int i = 0; i < v.size(); ++i) data[i + range] = v[i];
        for(int i = range - 1; i; --i) data[i] = opr(data[i * 2],data[i * 2 + 1]);
    }

    void eval(int k, int l, int r) {
        if(!lazyflag[k]) return;
        update_opr(data[k],lazy[k],r - l);
        if(r - l > 1) {
            lazy_opr(lazy[k * 2],lazy[k]);
            lazy_opr(lazy[k * 2 + 1],lazy[k]);
            lazyflag[k * 2] = lazyflag[k * 2 + 1] = true;
        }
        lazy[k] = lazy_idel;
        lazyflag[k] = false;
    }

    void update(int a, int b, Monoid val, int k = 1, int l = 0, int r = -1) {
        if(r < 0) r = range;
        eval(k,l,r);
        if(b <= l || r <= a) return;
        if(a <= l && r <= b) {
            lazy_opr(lazy[k],val);
            lazyflag[k] = true;
            eval(k,l,r);
        } else {
            update(a,b,val,k * 2,l,l + r >> 1);
            update(a,b,val,k * 2 + 1,l + r >> 1,r);
            data[k] = opr(data[k * 2],data[k * 2 + 1]);
        }
    }

    Monoid query(int a, int b, int k = 1, int l = 0, int r = -1) {
        if(r < 0) r = range;
        eval(k,l,r);
        if(b <= l || r <= a) return idel;
        if(a <= l && r <= b) return data[k];
        return opr(query(a,b,k * 2,l,l + r >> 1),query(a,b,k * 2 + 1,l + r >> 1,r));
    }
};

string S;
int Q,N;
int k[100];
i64 ans[100]={};
vct<int> Ds;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    
    cin>>N>>S>>Q;
    rep(i,Q) cin>>k[i];
    vct<pii> conv;
    rep(i,Q) {
        conv.emb(k[i],i);
    }
    sort(all(conv));
    int inv[100];
    rep(i,Q) inv[conv[i].sec]=i;
    //LazySegtree<i64> lsgt(N);
    int pos[100]={},sz=0;
    i64 sum[100]={};
    i64 mcnt[1000010];
    mcnt[0]=0;
    rep(i,N) {
        if(S[i]=='M') {
            rep(j,Q) sum[j]+=sz-pos[j];
            mcnt[i+1]=mcnt[i]+1;
        }else{
            mcnt[i+1]=mcnt[i];
        }
        if(S[i]=='D') {
            Ds.emb(i);
            sz++;
        }
        if(S[i]=='C') {
            rep(j,Q) {
                while(pos[j]<sz && Ds[pos[j]]<=i-k[j]) {
                    sum[j]-=mcnt[i]-mcnt[Ds[pos[j]]];
                    pos[j]++;
                }
                ans[j]+=sum[j];
            }
            
            // int las=sz;
            // i64 lasval=0;
            // for(pii p:conv) {
            //     //if(pos[j]==sz) continue;
            //     int j=p.sec;
            //     ans[j]+=(lasval+=lsgt.query(pos[j],las));
            //     las=pos[j];
            // }
        }
    }
    rep(j,Q) cout<<ans[j]<<endl;
}


Measured memory_bytes: 13972