parcare1

#include <bits/stdc++.h>

using namespace std;

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

#define STATE pair<int,bool>

const int NMAX = 20;
const int MOD  = 666013;

typedef long long I64;

int dp[NMAX+2][NMAX+2][NMAX+2][NMAX+2];
int aux[NMAX+2][NMAX+2][NMAX+2][NMAX+2];
int coloana[NMAX+2][NMAX+2];

int N, H, Q;

inline void add(int &a, int b)
{
    a += b;
    if( a >= MOD )
        a -= MOD;
}

int main()
{
    in >> N >> H >> Q;
    /// dinamica
    dp[0][0][0][0] = 1;
    for( int ind = 1;  ind <= N;  ++ind ) {
        int g;
        in >> g;
        for( int i = 0;  i <= NMAX;  ++i ) for( int x = 0;  x <= NMAX;  ++x )
        for( int j = 0;  j <= NMAX;  ++j ) for( int y = 0;  y <= NMAX;  ++y )
            aux[i][x][j][y] = dp[i][x][j][y];
        for( int i = 0;  i <= NMAX;  ++i ) for( int x = 0;  x <= NMAX;  ++x )
        for( int j = 0;  j <= NMAX;  ++j ) for( int y = 0;  y <= NMAX;  ++y ) {
            dp[i][x][j][y] = aux[i][x][j][y];
            if( i >= g && x > 0 )
                add(dp[i][x][j][y], 1LL * aux[i - g][x - 1][j][y] * x % MOD);  // cred ca nu e nevoie de modulo aici
            if( j >= g && y > 0 )
                add(dp[i][x][j][y], 1LL * aux[i][x][j - g][y - 1] * y % MOD);
        }
    }
    /// precalculare
    for( int i = 0;  i <= NMAX;  ++i ) for( int x = 0;  x <= NMAX;  ++x )
    for( int j = 0;  j <= NMAX;  ++j ) for( int y = 0;  y <= NMAX;  ++y )
        add(coloana[i][j], dp[i][x][j][y]);

    I64 ans = 1;
    for( int i = 1;  i <= Q;  ++i ) {
        int pos;
        in >> pos;
        ans = 1LL * ans * coloana[pos - 1][H - pos] % MOD;  /// MOD^2 da overflow pe int
    }
    out << ans << '\n';
    return 0;
}