#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#define ll long long

using namespace std;

const int N=;

int n;

ll L,R,b[N],c[N],mod,s[N],prn;

struct Matrix{

    ll a[N][N];

    Matrix(){memset(a,,sizeof a);}

    void init()

    {

        for(int i=;i<n;i++)a[i][]=c[i];

        for(int i=;i<n;i++)a[i-][i]=;

        a[][n]=a[n][n]=;

    }

    Matrix operator* (const Matrix &b)const

    {

        Matrix c;

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

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

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

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

        return c;

    }

}ans,r,yans,yr;

int main()

{

    scanf("%d",&n);

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

    {

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

        s[i]=s[i-]+b[i];

        ans.a[][n-i+]=b[i];

    }

    ans.a[][n+]=s[n-];

    yans=ans;

    for(int i=;i<=n;i++)scanf("%lld",&c[i]);

    scanf("%lld%lld%lld",&L,&R,&mod);

    n++;r.init();yr=r;

    if(R<n)prn=s[R];

    else

    {

        ll k=R-n+;

        while(k)

        {

            if(k&)ans=ans*r;

            r=r*r;k>>=1ll;

        }

        prn=(ans.a[][n]+ans.a[][])%mod;

    }

    if(L-<n)prn=((prn-s[L-])%mod+mod)%mod;

    else

    {

        ll k=L--n+;

        while(k)

        {

            if(k&)yans=yans*yr;

            yr=yr*yr;k>>=1ll;

        }

        prn=((prn-yans.a[][n]-yans.a[][])%mod+mod)%mod;

    }

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

    return ;

}