#include <fstream>
#include <iostream>
#include <vector>

using namespace std;

ifstream fin( "cowfood.in" );
ofstream fout( "cowfood.out" );

const int MAXS = 10000;
const int MAXK = 30;
const int MAXN = 20;
const int MOD = 3210121;

int cnt[MAXN + 5][MAXK + 5];
int comb[MAXS + MAXK + 5][MAXK + 5];

void precalc() {
  for ( int i = 1; i <= MAXS + MAXK; ++i ) {
	comb[i][1] = i;
    for ( int j = 2; j <= MAXK; ++j ) {
      comb[i][j] = (comb[i - 1][j] + comb[i - 1][j - 1]) % MOD;
    }
  }
}

int sum[MAXN + 5];
int sp, h, bad;
vector<int> a;

int N, K, S;

void pinex( int pos ) {
  if ( pos == N ) {
	if ( h == 0 ) return;
	if ( h & 1 ) bad = (bad + sum[S - sp]) % MOD;
	else bad = (bad - sum[S - sp]) % MOD;
	return;
  }
  pinex( pos + 1 );
  vector<int> b(K);
  ++h;
  for ( int i = 0; i < K; ++i ) {
	b[i] = a[i];
	sp -= a[i];
	a[i] = max(a[i], cnt[pos][i]);
	sp += a[i];
  }
  pinex( pos + 1 );
  for ( int i = 0; i < K; ++i ) {
	sp -= a[i];
	a[i] = b[i];
	sp += a[i];
  }
  --h;
}

int main() {
  int k, s, n;

  fin >> k >> s >> n;
  for ( int i = 0; i < n; ++i ) {
	for ( int j = 0; j < k; ++j ) {
	  fin >> cnt[i][j];
	}
  }
  precalc();
  sum[0] = 1;
  for ( int i = 1; i <= s; ++i ) {
    sum[i] = (sum[i-1] + comb[i + k - 1][k - 1]) % MOD;
  }
  for ( int i = 0; i < k; ++i ) {  
    a.push_back(0);
  }
  N = n, K = k, S = s;
  pinex( 0 );
  bad = (bad + 1 + s * k) % MOD;
  fout << (sum[s] - bad + MOD) % MOD;
  fin.close();
  fout.close();
  return 0;
}