// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
namespace AnyMod
{
    ullt Mod=-1;
    inline voi ChgMod(ullt v){Mod=v;}
    struct ModInt
    {
        private:
            ullt v;inline ullt chg(ullt w){return(w<Mod)?w:w-Mod;}
            inline ModInt _chg(ullt w){ModInt ans;ans.v=(w<Mod)?w:w-Mod;return ans;}
        public:
            ModInt():v(0){}
            ModInt(ullt v):v(v%Mod){}
            bol empty(){return!v;}
            inline ullt val(){return v;}
            friend bol operator<(ModInt a,ModInt b){return a.v<b.v;}
            friend bol operator>(ModInt a,ModInt b){return a.v>b.v;}
            friend bol operator<=(ModInt a,ModInt b){return a.v<=b.v;}
            friend bol operator>=(ModInt a,ModInt b){return a.v>=b.v;}
            friend bol operator==(ModInt a,ModInt b){return a.v==b.v;}
            friend bol operator!=(ModInt a,ModInt b){return a.v!=b.v;}
            inline friend ModInt operator+(ModInt a,ModInt b){return a._chg(a.v+b.v);}
            inline friend ModInt operator-(ModInt a,ModInt b){return a._chg(a.v+a.chg(Mod-b.v));}
            inline friend ModInt operator*(ModInt a,ModInt b){return a.v*b.v;}
            friend ModInt operator/(ModInt a,ModInt b){return b._power(Mod-2)*a.v;}
            friend ModInt operator^(ModInt a,ullt b){return a._power(b);}
            inline ModInt operator-(){return _chg(Mod-v);}
            ModInt sqrt()
            {
                if(power(v,(Mod-1)>>1,Mod)!=1)return 0;
                ModInt b=1;do b++;while(b._power((Mod-1)>>1)==1);
                ullt t=Mod-1,s=0,k=1;while(!(t&1))s++,t>>=1;
                ModInt x=_power((t+1)>>1),e=_power(t);
                while(k<s)
                {
                    if(e._power(1llu<<(s-k-1))!=1)x*=b._power((1llu<<(k-1))*t);
                    e=_power(Mod-2)*x*x,k++;
                }
                return _min(x,-x),x;
            }
            ModInt inv(){return _power(Mod-2);}
            ModInt _power(ullt index){ModInt ans(1),w(v);while(index){if(index&1)ans*=w;w*=w,index>>=1;}return ans;}
            voi read(){v=0;chr c;do c=getchar();while(c>'9'||c<'0');do v=(c-'0'+v*10)%Mod,c=getchar();while(c>='0'&&c<='9');v%=Mod;}
            voi print()
            {
                static chr C[20];uint tp=0;
                ullt w=v;do C[tp++]=w%10+'0',w/=10;while(w);
                while(tp--)putchar(C[tp]);
            }
            voi println(){print(),putchar('\n');}
            ModInt operator++(int){ModInt ans=*this;return v=chg(v+1),ans;}
        public:
            inline ullt&operator()(){return v;}
            inline ModInt&operator+=(ModInt b){return*this=_chg(v+b.v);}
            inline ModInt&operator-=(ModInt b){return*this=_chg(v+chg(Mod-b.v));}
            inline ModInt&operator*=(ModInt b){return*this=v*b.v;}
            ModInt&operator^=(ullt b){return*this=_power(b);}
            ModInt&operator/=(ModInt b){return*this=b._power(Mod-2)*v;}
            ModInt&operator++(){return v=chg(v+1),*this;}
    };
}
// Heaven and Earth... My guiding star...
using modint = AnyMod::ModInt;
struct num
{
    modint a,b;
    num():a(),b(){}
    num(modint a):a(a),b(){}
    num(modint a,modint b):a(a),b(b){}
    friend num operator+(num a,num b){return{a.a+b.a,a.b+b.b};}
    friend num operator-(num a,num b){return{a.a-b.a,a.b-b.b};}
    friend num operator*(num a,num b){return{a.a*b.a-a.b*b.b,a.b*b.a+b.b*a.a-a.b*b.b};}
};
uint Pow3[13],Cnt1[531442],Cnt2[531442];
num A[531442],B[531442],D[13][13];
num Pow(num base,uint t)
{
    num ans(1);
    while(t)
    {
        if(t&1)ans=ans*base;
        if((t>>=1))base=base*base;
    }
    return ans;
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
    uint n,t,p;scanf("%u%u%u",&n,&t,&p),AnyMod::ChgMod(p);
    Pow3[0]=1;for(uint i=0;i<n;i++)Pow3[i+1]=Pow3[i]*3;
    for(uint i=0;i<Pow3[n];i++)Cnt1[i]=Cnt1[i/3]+(i%3==1),Cnt2[i]=Cnt2[i/3]+(i%3==2);
    for(uint i=0;i<Pow3[n];i++)A[i].a.read();
    for(uint i=0;i<=n;i++)for(uint j=0;i+j<=n;j++)D[i][j].a.read();
    for(uint i=0;i<Pow3[n];i++)B[i]=D[Cnt1[i]][Cnt2[i]];
    for(uint i=0;i<n;i++)for(uint j=0;j<Pow3[n];j++)if(j/Pow3[i]%3==0)
    {
        num u=A[j+Pow3[i]],v=A[j+Pow3[i]*2];
        A[j+Pow3[i]*2]=A[j]-u*num(1,1)+v*num(0,1),A[j+Pow3[i]]=A[j]+u*num(0,1)-v*num(1,1),A[j]=A[j]+u+v;
    }
    for(uint i=0;i<n;i++)for(uint j=0;j<Pow3[n];j++)if(j/Pow3[i]%3==0)
    {
        num u=B[j+Pow3[i]],v=B[j+Pow3[i]*2];
        B[j+Pow3[i]*2]=B[j]-u*num(1,1)+v*num(0,1),B[j+Pow3[i]]=B[j]+u*num(0,1)-v*num(1,1),B[j]=B[j]+u+v;
    }
    for(uint i=0;i<Pow3[n];i++)D[Cnt1[i]][Cnt2[i]]=B[i];
    for(uint i=0;i<=n;i++)for(uint j=0;i+j<=n;j++)D[i][j]=Pow(D[i][j],t);
    for(uint i=0;i<Pow3[n];i++)A[i]=A[i]*D[Cnt1[i]][Cnt2[i]];
    for(uint i=0;i<n;i++)for(uint j=0;j<Pow3[n];j++)if(j/Pow3[i]%3==0)
    {
        num u=A[j+Pow3[i]],v=A[j+Pow3[i]*2];
        A[j+Pow3[i]*2]=A[j]+u*num(0,1)-v*num(1,1),A[j+Pow3[i]]=A[j]-u*num(1,1)+v*num(0,1),A[j]=A[j]+u+v;
    }
    modint w=modint((p+1)%3?(p*2+1)/3:(p+1)/3)^n;
    for(uint i=0;i<Pow3[n];i++)(A[i].a*w).println();
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。