#include <iostream>

#include <cstdio>

#include <algorithm>

#include <cstring>

using namespace std;

const int N = ;

#define LL long long

LL n, m, k;

struct Matrix {LL M[N][N];} A;

Matrix operator * (Matrix &a, Matrix &b) {

    Matrix ret;

    memset(ret.M, , sizeof ret.M);

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

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

            if(a.M[i][j])

                for(int K = ; K <= n; K ++)

                    ret.M[i][K] = (ret.M[i][K] + a.M[i][j] * b.M[j][K]);

    return ret;

}

Matrix Ksm(int p) {

    Matrix Ans;

    memset(Ans.M, , sizeof Ans.M);

    for(int i = ; i <= n; i ++) Ans.M[i][i] = ;

    while(p) {

        if(p & ) Ans = Ans * A;

        A = A * A;

        p >>= ;

    }

    return Ans;

}

int main() {

    while() {

        cin >> n >> k >> m;

        if(n ==  && m ==  && k == ) return ;

        n ++;

        char s[];

        memset(A.M, , sizeof A.M);

        for(int i = ; i <= n; i ++) A.M[i][i] = ;

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

            scanf("%s", s);

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

                int x; std:: cin >> x;

                A.M[x][n] ++;

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

                int x; std:: cin >> x;

                for(int j = ; j <= n; j ++) A.M[x][j] = ;

            } else {

                int x, y; std:: cin >> x >> y;

                swap(A.M[x], A.M[y]);

            }

        }

        Matrix Answer = Ksm(k);

        for(int i = ; i < n; i ++) cout << Answer.M[i][n] << " ";

        printf("\n");

    }

    return ;

}