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

typedef long long ll;

const int N = (1 << 18);
const int B = 18;

ll n, mod, k, f[N][B];

int main() {
	#ifdef LOCAL
		assert(freopen("test.in", "r", stdin));
		assert(freopen("test.out", "w", stdout));
	#endif
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	cin >> n >> mod >> k;
	for (int i = 0; i < (1 << n); ++i) {
		for (int j = 0; j < n; ++j) {
			f[i][j] = 1;
		}
	}
	while (k--) {
		int x, y, z;
		cin >> x >> y >> z;
		f[x][y] = f[x][y] * z % mod;
	}
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < (1 << n); ++j) {
			for (int k = 0; k < n - 1; ++k) {
				if (!(j & (1 << i))) {
					f[j ^ (1 << i)][k] = f[j ^ (1 << i)][k] * f[j][k + 1] % mod;
					f[j][k] = f[j][k] * f[j ^ (1 << i)][k + 1] % mod;
				}
			}
		}
	}
	for (int i = 0; i < (1 << n); ++i) {
		cout << f[i][0] << " ";
	}
	cout << "\n";
	return 0;
}