#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <algorithm>

using namespace std;

#define inf (0x3f3f3f3f)

typedef long long int LL;

#include <iostream>

#include <sstream>

#include <vector>

#include <set>

#include <map>

#include <queue>

#include <string>

const int maxn =  + ;

struct Matrix {

    LL a[maxn][maxn];

    int row;

    int col;

};

struct Matrix c; //这个要多次用到，栈分配问题，maxn不能开太大，

struct Matrix matrix_mul  (struct Matrix a,struct Matrix b,int MOD) {

    //求解矩阵a*b%MOD

    struct Matrix c = {};

    //LL的时候更加是，空间是maxn*maxn的，这样时间用得很多

    c.row=a.row; //行等于第一个矩阵的行

    c.col=b.col; //列等于第二个矩阵的列

    for (int i = ; i <= a.row; ++i) {

        for (int k = ; k <= a.col; ++k) {

            if (a.a[i][k]) {//应付稀疏矩阵

                for (int j = ; j <= b.col; ++j) {

                    c.a[i][j] += a.a[i][k] * b.a[k][j];

                }

            }

        }

    }

    return c;

}

struct Matrix quick_matrix_pow  (struct Matrix ans,struct Matrix base,int n,int MOD) {

    //求解a*b^n%MOD

//    cout << n << endl;

    while (n) {

        if (n&) {

            ans=matrix_mul(ans,base,MOD);//传数组不能乱传,不满足交换律

        }

        n>>=;

        base=matrix_mul(base,base,);

    }

    return ans;

}

int n, m, k;

void work() {

    struct Matrix b = {};

    b.row = b.col = n;

    for (int i = ; i <= n; ++i) {

        b.a[i][i] = ;

    }

    for (int i = ; i <= k; ++i) {

        char str[];

        int a, c;

        scanf("%s", str);

        if (str[] == 'g') {

            scanf("%d", &a);

            ++b.a[][a];

        } else if (str[] == 'e') {

            scanf("%d", &a);

            for (int j = ; j <= n; ++j) {

                b.a[j][a] = ;

            }

        } else {

            scanf("%d%d", &a, &c);

            for (int j = ; j <= n; ++j) {

                swap(b.a[j][a], b.a[j][c]);

            }

        }

    }

//    for (int i = 0; i <= n; ++i) {

//        for (int j = 0; j <= n; ++j) {

//            cout << b.a[i][j] << " ";

//        }

//        cout << endl;

//    }

    struct Matrix tt = {};

    tt.row = ;

    tt.col = n;

    tt.a[][] = ;

    struct Matrix ans = quick_matrix_pow(tt, b, m, );

    for (int i = ; i <= n; ++i) {

        printf("%lld ", ans.a[][i]);

    }

    printf("\n");

}

int main() {

#ifdef local

    freopen("data.txt","r",stdin);

#endif

    while (scanf("%d%d%d", &n, &m, &k) != EOF && n + m + k) work();

    return ;

}