#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ui unsigned int
int n, k, q;
string s;
int a[1005];
ui ksm(ui x, int y){
    ui ans = 1;
    while(y){
        if(y&1)ans = ans * x;
        y >>= 1;
        x = x * x;
    }
    return ans;
}
int c[1005];
ui ans;
int m;
// unordered_map<int, ui> dp[1005];
ui dp[1005][1<<17];
// ui dp[1005][1<<16];
ui KSM[1005][105];
// ui ANS[55][1<<16][17];
// bool vis[55][1<<16][17];
int ord[1005];
ui calc(int n, int m, int K, int bh){
    // if(vis[ord[n]][m][K]){
    //     return ANS[ord[n]][m][K];
    // }
    ui ans = 0;
    for(int i = (n?min(31/n,K - 1):K-1); i >= 0; i--){
        if(m>>i&1){
            int num = __builtin_popcount(m>>i+1);
            if(1ll * i * n < 32){
                ans += ((ui)1 << i * n) * KSM[bh][num];
            }
        }
    }
    ans = -ans;
    if(1ll * K * n < 32)ans += (ui)1<<K*n;
    return ans;
    // vis[ord[n]][m][K] = 1;
    // return ANS[ord[n]][m][K] = ans;
}
unordered_map<int, int> mp;
int zh(int x, int y){
    if(!x)return 0;
    if(mp[x]){
        return mp[x];
    }
    int wei = 0;
    int ans = 0;
    for(int i = 0; i < k; i++){
        if(y>>i&1){
            if(x>>i&1){
                ans |= (1<<wei);
            }
            wei++;
        }
    }
    return mp[x] = ans;
}
signed main(){
    // freopen("dp.in", "r", stdin);
    // freopen("dp.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin >> n >> k >> q;
    cin >> s;
    int ok = 1;
    for(auto i : s){
        if(i == 'A')ok = 0;
    }
    if(ok){
        while(q--){
            cin >> m;
            int bh = -1, K = k;
            ui ans = 0;
            for(int i = (n?min(31/n,K - 1):K-1); i >= 0; i--){
                if(m>>i&1){
                    int num = __builtin_popcount(m>>i+1);
                    if(1ll * i * n < 32){
                        ans += ((ui)1 << i * n) * (bh==-1?ksm(n,num): KSM[bh][num]);
                    }
                }
            }
            ans = -ans;
            if(1ll * K * n < 32)ans += (ui)1<<K*n;
            cout << ans << '\n';
        }
        return 0;
    }
    vector<int>vec;
    set<int>st;
    for(int i = 1; i <= n; i++){
        int en = i;
        while(en + 1 <= n && s[en-1] != 'A')en++;
        vec.emplace_back(en - i + 1);
        i = en;
    }
    for(int i = 1; i <= vec.size(); i++){
        for(int j = 0; j <= k; j++){
            KSM[i][j] = ksm(vec[i-1] - (i!=1), j);
        }
        st.insert(vec[i-1]-(i!=1));
    }
    vector<int>vecc;
    for(auto i : st){
        vecc.emplace_back(i);
        ord[i] = vecc.size() - 1;
    }
    while(q--){
        cin >> m;
        for(int i = 0; i <= vec.size(); i++){
            for(int j = m; ; j = (j-1) & m){
                dp[i][zh(j,m)] = 0;
                if(!j)break;
            }
        }
        dp[vec.size()][zh(m,m)] = 1;
        for(int i = vec.size(); i >= 1; i--){
            for(int j = m; ; j = (j-1) & m){
            // for(int j = 0; j < (1<<k); j++){
                if(!dp[i][zh(j,m)]){
                    if(!j)break;
                    continue;
                }
                for(int w = j; ; w = (w-1) & j){
                    int pw = w==0?k:__lg(w&(-w));
                    int num = __builtin_popcount((j^w) >> pw);
                    dp[i - 1][zh(w,m)] += dp[i][zh(j,m)] * KSM[i][num] * calc(vec[i-1] - (i!=1), (j^w) & (1<<pw)-1, pw, i) * (i==1?1:(ui)(((ui)1<<k)-w));
                    if(!w)break;
                }
                if(!j)break;
            }
        }
        cout << dp[0][0] << '\n';
    }
    return 0;
}