#include <bits/stdc++.h>
#define MOD 666013
#define ll long long

using namespace std;

ifstream f ("parcare1.in");
ofstream g ("parcare1.out");

ll n , l , row;
ll col;
ll a[25] , fr[25] , coef[25] , c[25][25];

void bkt(ll k , ll sum)
{
    if(k == n + 1)
    {
        if(sum == 0)
        {

        }
    }
    else
    {
        for(ll i = 0 ; i <= fr[a[k]] ; i++)
        {
            if(sum - a[k] * i >= 0)
            {
                coef[k] = i;
                bkt(k + 1 , sum - a[k] * i);
            }
        }
    }
}

void comb()
{
    ll i , j;

    c[0][0] = 1;

    for(i = 1 ; i <= 20 ; i++)
        for(j = 0 ; j <= i ; j++)
            c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % MOD;
}

int main()
{
    ll i , ans = 1 , m = 0;

    f >> n >> l >> col;

    for(i = 0 ; i < n ; ++i)
    {
        f >> row;

        if(!fr[row])
            a[++m] = row;

        ++fr[row];
    }

    n = m;

    for(i = 1 ; i <= col ; i++)
    {
        f >> row;
        ++mark[row];
    }

    for(i = 1 ; i <= l ; i++)
        if(mark[i])
            ans = ans * Pow(solve(i) , mark[i]) % MOD;

    g << ans;

    return 0;
}