#include <cstdio>

using namespace std;

const int NMAX = 21,
          KMAX = 31,
          SMAX = 10001,
          MOD = 3210121;

int k, s, n, v, e,
    m[NMAX][KMAX], x[NMAX], MAX[NMAX][KMAX], sComb[SMAX];

inline int max(int a, int b) {
    return (a>b) ? a : b;
}
void cSumComb() {
    for(int i = 0; i <= s; i++)
        sComb[i] = 1;
    for(int i = 1; i <= k; i++)
        for(int j = 1; j <= s; j++)
            sComb[j] = (sComb[j]+sComb[j-1])%MOD;
}

void bt(int z, int pos) {
    if(z > 0) {
        for(int j = 1; j <= k; j++)
            MAX[z][j] = max(MAX[z-1][j], m[pos][j]);
        int sum = 0;
        for(int i = 1; i <= k; i++)
            sum += MAX[z][i];
        if(sum <= s)
            e = (z%2 == 0) ? (e+MOD-sComb[s-sum])%MOD : (e+sComb[s-sum])%MOD;
    }
    if(z < n)
        for(int i = pos+1; i <= n; i++)
            bt(z+1, i);
}
int main()
{
    freopen("cowfood.in", "r", stdin);
    freopen("cowfood.out", "w", stdout);
    scanf("%i %i %i", &k, &s, &n);
    cSumComb();
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= k; j++)
            scanf("%i", &m[i][j]);

    bt(0, 0);

    v = (sComb[s] + (MOD-s * k -1)+MOD-e)%MOD;
    printf("%i", v);
    return 0;
}