/**
  * Worg
  */
#include <cstdio>
#include <algorithm>

using namespace std;
FILE *fin = freopen("cowfood.in", "r", stdin);
FILE *fout = freopen("cowfood.out", "w", stdout);

const int MAX_K = 1 + 30;
const int MAX_S = 1 + 10000;
const int MAX_N = 1 + 20;
const int MOD = 3210121;

/*---------------------*/ /** General */
int K, S, N;
int a[MAX_N][MAX_K];
/*---------------------*/ /** DP & Pinex */
int dp[3][MAX_K][MAX_S], dp_2[MAX_K][MAX_S];

int maxA[MAX_K];
/*---------------------*/

void readData() {
    scanf("%d%d%d", &K, &S, &N);
    for(int i = 1; i <= N; i++) {
        for(int j = 1; j <= K; j++) {
            scanf("%d", &a[i][j]);
        }
    }
}

void generateDP() {
    /* dp with at least 2 elements > 0 ---> dp[2][i][j] */

    for(int i = 1; i <= S; i++) {
        dp[2][1][i] = i;
    }
    for(int i = 2; i <= S; i++) {
        dp[2][2][i] = (dp[2][2][i - 1] + dp[2][1][i - 1]) % MOD;
    }
    for(int i = 3; i <= K; i++) {
        for(int j = 2; j <= S; j++) {
            dp[2][i][j] = (dp[2][i][j - 1] + dp[2][i - 1][j]) % MOD;
        }
    }

    /* dp with at least 1 element > 0 ---> dp[1][i][j] */

    for(int i = 1; i <= S; i++) {
        dp[1][1][i] = i;
    }
    for(int i = 2; i <= K; i++) {
        for(int j = 1; j <= S; j++) {
            dp[1][i][j] = (dp[1][i][j - 1] + dp[1][i - 1][j]) % MOD;
        }
    }

    /* dp with at least 0 elements > 0 ---> dp[0][i][j] */

    for(int i = 0; i <= S; i++) {
        dp[0][1][i] = i + 1;
    }
    for(int i = 2; i <= K; i++) {
        dp[0][i][0] = 1;
        for(int j = 1; j <= S; j++) {
            dp[0][i][j] = (dp[0][i][j - 1] + dp[0][i - 1][j]) % MOD;
        }
    }
}

int Pinex(int mask) {
    int countExp = 0;
    int sign;

    for(int i = 1; i <= N; i++) {
        if(mask & (1 << (i - 1))) {
            countExp++;
            for(int j = 1; j <= K; j++) {
                maxA[j] = max(maxA[j], a[i][j]);
            }
        }
    }
    if(countExp % 2 == 1) {
        sign = -1;
    } else {
        sign = 1;
    }

    int unUsed = S;
    int notZero = 0;
    for(int i = 1; i <= K; i++) {
        unUsed -= maxA[i];
        if(maxA[i] > 0) {
            notZero++;
        }
        maxA[i] = 0; /* we reset the values afterwards */
    }

    if(unUsed >= 0) {
        if(notZero >= 2) {
            return sign * dp[0][K][unUsed];
        } else if(notZero == 1) {
            return sign * dp[1][K][unUsed];
        } else {
            return sign * dp[2][K][unUsed];
        }
    } else {
        return 0;
    }
}

int countValidExperiments() {
    int answer = dp[2][K][S];
    const int maxMask = 1 << N;

    for(int i = 1; i < maxMask; i++) {
        answer = (answer + Pinex(i));
        while(answer < 0) {
            answer += MOD;
        }
        answer %= MOD;
    }

    return answer;
}

int main() {
    readData();
    generateDP();
    printf("%d", countValidExperiments());
    return 0;
}