#include <bits/stdc++.h>
using namespace std;
const int MAXN = 8;
int N, K, T,X[102], fr[22],Q[22];
map<int, long long> P;
long long number;
inline int code(int num, int what)
{
    return (num / Q[what]) % (N + 1);
}
long long getP(int num)
{
    if (num / MAXN == N * Q[K]) return 1;
    if (P.find(num) != P.end()) return P[num];
    int last = num % MAXN, bitn = num / MAXN;
    long long rez = 0;
    for (int i = 0; i <= K - 1; ++i)
    {
        if (code(bitn, i) - (i == last) > 0)
            rez += (code(bitn, i) - (i == last)) * getP((bitn - Q[i] + Q[i + 1]) * MAXN + i + 1);
        if (rez >= (1LL << 55))
        {
            rez = 1LL << 55;
            break;
        }
    }
    P[num] = rez;
    return rez;
}
int main()
{
    ifstream f("nkperm.in");
    ofstream g("nkperm.out");
    f >> N >> K >> T;
    Q[0] = 1;
    for (int i = 1; i <= K + 1; ++i)
        Q[i] = Q[i - 1] * (N + 1);
    for (int test = 1; test <= T; ++test)
    {
        char opt;
        f >> opt;
        if (opt == 'A')
        {
            for (int i = 1; i <= N * K; ++i) f >> X[i];
            memset(fr, 0, sizeof fr);
            long long result = 1;
            for (int i = 1; i <= N * K; ++i)
            {
                int q = 0;
                for (int j = 1; j <= N; ++j)
                    q += Q[fr[j]];
                for (int j = 1; j < X[i]; ++j)
                    if (j != X[i - 1] && fr[j] < K)
                        result += getP((q - Q[fr[j]] + Q[fr[j] + 1]) * MAXN + (fr[j] + 1));
                ++fr[X[i]];
            }
            g << result << '\n';
        }
        else
        {
            f >> number;
            --number;
            memset(fr, 0, sizeof fr);
            int q = Q[0] * N, last = -1;
            for (int i = 1; i <= N * K; ++i)
            {
                int j;
                for (j = 1; j <= N; ++j)
                    if (j != last && fr[j] < K)
                    {
                        if (getP((q - Q[fr[j]] + Q[fr[j] + 1]) * MAXN + (fr[j] + 1)) <= number) number -= getP((q - Q[fr[j]] + Q[fr[j] + 1]) * MAXN + (fr[j] + 1));
                        else break;
                    }
                q -= Q[fr[j]];
                q += Q[fr[j] + 1];
                ++fr[j];
                g << j << ' ';
                last = j;
            }
            g << '\n';
        }
    }
}