import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum mod = 10L^^9 + 7;
enum inf = 10^^9;

void main() {
    int n;
    scan(n);
    string s;
    scan(s);
    int q;
    scan(q);

    auto k = readln.split.to!(int[]);

    foreach (ki ; k) {
        auto ans = solve(n, s, ki);
        writeln(ans);
    }
}


long solve(int n, string s, int k) {
    long ans;
    long cntd, cntm, dm;

    foreach (i ; 0 .. n) {
        if (s[i] == 'C') {
            ans += dm;
        }
        
        if (i >= k - 1) {
            if (s[i - (k-1)] == 'D') {
                dm -= cntm;
                cntd--;
            }
            else if (s[i - (k-1)] == 'M') {
                cntm--;
            }
        }

        if (s[i] == 'D') {
            cntd++;
        }
        else if (s[i] == 'M') {
            dm += cntd;
            cntm++;
        }
    }

    return ans;
}


























void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}