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) {
    auto mcs = new long[](n + 1);

    long cntm, cntc;
    long mc;

    foreach (i ; 0 .. k - 1) {
        if (s[i] == 'M') {
            cntm++;
        }
        else if (s[i] == 'C') {
            cntc++;
            mc += cntm;
        }
    }

    mcs[0] = mc;

    foreach (i ; k - 1 .. n) {
        if (s[i - (k - 1)] == 'M') {
            mc -= cntc;
            cntm--;
        }
        else if (s[i - (k - 1)] == 'C') {
            cntc--;
        }

        if (s[i] == 'M') {
            cntm++;
        }
        else if (s[i] == 'C') {
            mc += cntm;
            cntc++;
        }

        debug {
            //writeln(cntm, " ", cntc);
        }

        mcs[i - (k - 1) + 1] = mc;
    }

    debug {
        writeln(mcs);
    }

    foreach (i ; n - (k - 1) + 1 .. n + 1) {
        if (s[i-1] == 'M') {
            mc -= cntc;
            cntm--;
        }
        else if (s[i-1] == 'C') {
            cntc--;
        }

        mcs[i] = mc;
    }

    debug {
        writeln(mcs);
    }

    long ans;

    foreach (i ; 0 .. n) {
        if (s[i] == 'D') {
            ans += mcs[i + 1];
        }
    }

    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);
        }
    }
}