#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int N, M, K;
    cin >> N >> M >> K;

    // dp[i][j][k] = common multiplier to all bitmasks that match j in the first i bits,
    // and differ in k locations in the last N - i bits.
    // The dp essentially builds the bitmasks that differ with the queries in the specified
    // number of bits, taking advantage of common intermediaries. 
    vector<vector<vector<long long>>> dp(N + 1, vector<vector<long long>>(1 << N, vector<long long>(N + 1, 1)));
    for (int i = 0; i < K; i++) {
        int C, D, X;
        cin >> C >> D >> X;
        dp[0][C][D] = X % M;
    }
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < (1 << N); j++) {
            for (int k = 0; k <= N; k++) {
                if (dp[i][j][k] != 1) {
                    dp[i + 1][j][k] *= dp[i][j][k];
                    dp[i + 1][j][k] %= M;
                    if (k > 0) {
                        dp[i + 1][j ^ (1 << i)][k - 1] *= dp[i][j][k];
                        dp[i + 1][j ^ (1 << i)][k - 1] %= M;
                    }
                } 
            }
        }
    }

    for (int i = 0; i < (1 << N); i++) {
        cout << dp[N][i][0] << " ";
    }
    cout << "\n";
}