#include<cstdio>
#include<vector>
using namespace std;
typedef long long ll;
inline ll read(){
	ll x=0;
	int f=0,ch=0;
	while(ch<48||ch>57) f=(ch=='-'),ch=getchar();
	while(ch>47&&ch<58) x=(x<<3)+(x<<1)+(ch&15),ch=getchar();
	return f?-x:x;
}
inline void write(ll x,char end=' '){
	if(x==0){
		putchar('0');
		putchar(end);
		return;
	}
	if(x<0) putchar('-'),x=-x;
	int ch[70]={0},cnt=0;
	while(x){
		ch[cnt++]=(int)(x%10);
		x/=10;
	}
	while(cnt--) putchar(ch[cnt]+48);
	putchar(end);
}
const int N=1e5+5;
const int M=3e5+5;
#define pii pair<int,int>
int n,k,up;
ll m;
int p[20][N],cnt[20];
int mul[20][N];
ll a[M];
int main(){
	n=read(),m=read(),k=read();
	up=(1<<n);
	for(int i=0;i<up;++i){
		int g=i,c=0;
		while(g){
			if(g&1)
				++c;
			g>>=1;
		}
		p[c][++cnt[c]]=i;
	}
	for(int i=0;i<=n;++i){
		for(int j=0;j<up;++j)
			mul[i][j]=1;
	}
	for(int i=1;i<=k;++i){
		int c=read(),d=read(),x=read()%m;
		mul[d][c]=mul[d][c]*x%m;
	}
	for(int i=0;i<up;++i) a[i]=1;
	for(int i=0;i<=n;++i){
		for(int j=0;j<up;++j){
			if(mul[i][j]==1) continue;
			for(int t=1;t<=cnt[i];++t){
				a[p[i][t]^j]=a[p[i][t]^j]*mul[i][j]%m;
			}
		}
	}
	for(int i=0;i<up;++i) write(a[i]);
	return 0;
}