#include<bits/stdc++.h>
using namespace std;
const int N=1e7+10;
int d=1,n=1,m=1;
long long a[30],f[N];
void init()
{
    for(int i=0;i<=30;i++) a[i]=0;
    for(int i=0;i<=N;i++) f[i]=0;
    return;
}
int main()
{
    freopen("recurrences.in","r",stdin);
    freopen("recurrences.out","w",stdout);
    
    while(d!=0&&n!=0&&m!=0)
    {
        cin>>d>>n>>m;
        init();
        for(int i=1;i<=d;i++) cin>>a[i];
        for(int i=1;i<=d;i++) cin>>f[i];
        for(int i=d+1;i<=n;i++) for(int j=1;j<=d;j++) f[i]=(f[i]+a[j]*f[i-j])%m;
        cout<<f[n]<<endl;
    }
    return 0;
}