#include<map>

#include<set>

#include<string>

#include<queue>

#include<stack>

#include<cmath>

#include<vector>

#include<cstdio>

#include<time.h>

#include<cstring>

#include<iostream>

#include<algorithm>

#define INF 1000000001

#define ll long long

#define lson l,m,rt<<1

#define rson m+1,r,rt<<1|1

using namespace std;

const int MAXN = ;

struct Mat

{

    ll a[MAXN][MAXN];

    void Init(){

        memset(a,,sizeof(a));

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

            a[i][i] = ;

        }

    }

};

ll fa[MAXN],d[MAXN];

ll n,k,MOD;

Mat a;

void Init()

{

    memset(a.a,,sizeof(a.a));

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

        a.a[i][i+] = ;

    }

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

        a.a[n-][i] = fa[n - i - ];

    }

}

Mat Matadd(Mat a,Mat b)

{

    Mat c;

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

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

            c.a[i][j] = (a.a[i][j] + b.a[i][j])%MOD;

        }

    }

    return c;

}

Mat Matmul(Mat a,Mat b)

{

    Mat c;

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

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

            c.a[i][j] = ;

            for(int k = ; k < n; k++){

                c.a[i][j] += (a.a[i][k] * b.a[k][j])%MOD;

            }

            c.a[i][j] %= MOD;

        }

    }

    return c;

}

Mat power(Mat a,ll n)

{

    Mat c;

    c.Init();

    while(n){

        if(n & ){

            c = Matmul(c,a);

        }

        a = Matmul(a,a);

        n >>= ;

    }

    return c;

}

int main()

{

    #ifndef ONLINE_JUDGE

    freopen("data","r",stdin);

    #endif

    while(~scanf("%lld%lld%lld",&n,&k,&MOD)){

        if(!n && !k && !MOD)break;

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

            scanf("%lld",&fa[i]);

            fa[i] %= MOD;

        }

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

            scanf("%lld",&d[i]);

            d[i] %= MOD;

        }

        Init();

        a = power(a,k-);

        ll ans = ;

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

            ans += a.a[][i] * d[i] % MOD;

            ans %= MOD;

        }

        printf("%lld\n",ans);

    }

    return ;

}