#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

#define N 100050

#define ll long long

#define MOD 20130427

inline int rd()

{

    int f=,c=;char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

    while(ch>=''&&ch<=''){c=*c+ch-'';ch=getchar();}

    return f*c;

}

ll b;

ll L[N],l,R[N],r;

ll f[N][],g[N][];

ll h[N],s[N];

ll sol(ll *x,int n)

{

    memset(f,,sizeof(f));

    memset(g,,sizeof(g));

    memset(h,,sizeof(h));

    memset(s,,sizeof(s));

    h[] = s[] = x[]-;

    f[][] = g[][] = x[]*(x[]-)/;

    f[][] = g[][] = x[];

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

    {

        s[i] = ( s[i-]*b%MOD + x[i] + b - )%MOD;

        h[i] = ( (h[i-]+s[i-])*b%MOD + x[i]*i%MOD + b - )%MOD;

        f[i][] = (f[i-][]*b%MOD*b%MOD

              +(h[i-]+s[i-]+)%MOD*((b*(b-)/)%MOD)%MOD

              +f[i-][]*x[i]%MOD*b%MOD

              +1ll*i*((x[i]*(x[i]-)/)%MOD)%MOD)%MOD;

        f[i][] = ( f[i-][]*b%MOD + x[i]*i%MOD )%MOD;

        g[i][] = ( g[i-][]*b%MOD + f[i][] + g[i-][]*x[i]%MOD)%MOD;

        g[i][] = ( g[i-][] + f[i][] )%MOD;

//        printf("%lld %lld %lld %lld\n",f[i][0],f[i][1],g[i][0],g[i][1]);

    }

    return ((g[n][]+g[n][])%MOD+MOD)%MOD;

}

int main()

{

    b = rd();

    l = rd();

    for(int i=;i<=l;i++)L[i]=rd();

    L[l]--;

    for(int i=l;L[i]<;i--)L[i-]--,L[i]+=b;

    if(!L[])

    {

        l--;

        for(int i=;i<=l;i++)L[i]=L[i+];

    }

    r = rd();

    for(int i=;i<=r;i++)R[i]=rd();

    printf("%lld\n",((sol(R,r)-sol(L,l))%MOD+MOD)%MOD);

    return ;

}