10 2 5
1 1 1 2 2 2 2 2 2 2
 10 2 5
1 1 1 1 1 1 2 2 2 2
 3 3 2
1 3 1
 8 8 7
7 2 8 6 8 5 3 8
 7 7 5
2 6 3 6 3 5 1
 5 5 1
5 2 5 1 2
 6 6 6
5 6 5 3 4 2
 5 5 2
2 3 2 2 4
 3 3 3
1 1 1
 111 78 54
24 13 49 22 52 38 38 63 21 10 9 56 60 47 11 78 23 52 55 12 72 33 17 14 33 59 21 32 20 73 1 60 27 64 23 74 36 49 69 14 29 37 19 61 52 33 26 27 10 11 34 25 62 47 36 12 63 45 31 71 78 1 6 26 36 65 56 46 19 28 77 64 56 8 77 38 3 33 63 77 40 7 22 13 60 14 57 43 51 10 30 21 7 67 32 11 12 9 72 24 27 67 25 63 6 67 69 37 26 19 26
 10 2 5
1 1 1 1 1 1 1 1 1 2
 6 6 1
4 5 6 3 5 3
 10 2 5
1 1 1 1 2 2 2 2 2 2
 8 8 3
8 8 2 7 8 2 3 5
 7 7 4
4 6 6 7 2 5 3
 10 2 5
2 2 2 2 2 2 2 2 2 2
 111 67 97
32 67 4 15 17 17 23 6 39 54 19 62 28 59 63 36 44 40 28 67 28 3 55 19 11 26 3 38 22 26 62 54 61 15 22 4 47 53 27 36 31 5 16 59 51 62 51 46 7 55 26 66 50 51 32 17 54 14 18 14 40 30 24 2 61 16 16 27 55 58 35 7 26 3 26 4 13 59 14 32 56 54 5 46 39 30 45 24 37 12 67 38 45 32 41 21 46 26 41 29 15 28 65 5 19 53 13 31 58 18 57
 6 6 2
4 4 2 4 2 3
 10 2 5
1 1 1 1 1 2 2 2 2 2
 10 2 5
1 1 1 1 1 1 1 1 2 2
 6 6 4
5 2 4 3 1 5
 10 2 5
1 1 2 2 2 2 2 2 2 2
 1 1 1
1
 8 8 5
7 5 6 8 2 8 3 4
 10 2 5
1 1 1 1 1 1 1 2 2 2
 111 101 52
54 69 33 81 8 90 48 21 96 35 44 75 68 34 101 82 93 94 86 76 33 91 5 70 22 84 70 71 62 81 50 83 51 43 95 46 19 53 101 34 51 40 6 17 69 60 73 89 65 75 59 68 62 49 89 23 63 83 86 68 62 39 1 18 3 75 44 57 9 24 67 81 83 45 93 66 79 71 43 49 17 2 33 38 98 71 71 21 56 16 31 2 75 61 64 38 69 80 81 12 68 95 26 9 69 82 41 35 75 7 71
 3 3 3
3 3 1
 4 4 2
2 4 4 3
 10 2 5
1 2 2 2 2 2 2 2 2 2
 4 4 4
4 4 4 4
 3 3 2
1 2 3
 2 1 2
1 1
 5 5 3
3 4 1 5 5
 7 7 1
2 6 5 6 2 3 3
 111 9 57
9 9 2 6 8 6 5 8 9 7 3 9 1 2 6 6 5 3 1 1 6 1 8 4 3 9 8 6 8 1 9 8 5 8 6 9 4 5 7 3 1 6 4 3 2 5 7 3 1 7 9 1 7 1 3 5 9 5 6 2 2 7 9 7 1 5 5 5 5 2 6 5 7 3 8 9 7 3 6 5 1 9 2 9 9 8 8 7 9 1 6 2 4 5 7 4 8 9 9 2 7 7 6 9 8 2 1 3 3 1 5
 4 4 1
2 4 1 4
 2 1 1
1 1
 111 16 58
15 6 4 7 7 10 16 2 3 1 4 8 10 1 2 11 6 6 14 16 6 16 1 2 13 2 7 13 1 4 1 4 12 2 4 11 15 12 9 13 10 4 11 7 5 3 12 11 11 3 16 15 9 6 15 11 4 14 8 15 16 3 9 10 9 1 8 4 14 7 13 5 1 8 5 11 8 14 1 8 15 2 5 2 4 5 9 2 10 11 11 5 7 11 11 14 5 16 14 2 4 11 12 10 7 14 2 5 3 2 1
 2 2 2
1 1

4
 5
 2
 6
 12
 3
 1
 4
 1
 648
 2
 4
 5
 19
 25
 1
 214
 5
 6
 3
 11
 3
 1
 41
 4
 881
 1
 4
 2
 1
 3
 1
 7
 4
 446
 3
 1
 552
 1

//Hello Wolrd
//强的人Wzp已经Ak了IOI2018
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef complex<double> E;
const int inf = 0x3f3f3f3f,oo = inf;
#define RG register
#define rep(i,a,b) for(RG int i=(a);i<(b);++i)
#define Rep(i,a,b) for(RG int i=(a);i<=(b);++i)
#define Dep(i,a,b) for(RG int i=(a);i>=(b);--i)
#define pc putchar
#ifdef LOCAL
char __wzp[1<<15|1],*__S=__wzp+32768;
#define gc() (__S>=__wzp+32768?(__wzp[fread(__wzp,sizeof(char),1<<15,stdin)]=EOF),*((__S=__wzp)++):*(__S++))
#else
#define gc getchar
#endif
inline ll read(){
	RG ll x=0,f=1;RG char c=gc();
	for(;!isdigit(c);c=gc())if(c=='-')f=-1;
	for(;isdigit(c);c=gc())x=(x<<1)+(x<<3)+(c^48);
	return x*f;
}
inline void write(ll x){if(x<0)x=-x,pc('-');if(x>=10)write(x/10);pc(x%10+'0');}
inline void writeln(ll x){write(x);puts("");}

#define debug(x) printf(#x" = %d\n",x);
#define rd read
#define mem(x,v) memset(x,v,sizeof(x))
#define pb push_back
#define mp make_pair
#define sqr(x) ((x)*(x))
#define lowbit(x) ((x)&(-(x)))
#define fin(x) freopen(#x".in","r",stdin)
#define fout(x) freopen(#x".in","w",stdout)
#define y1 ____y1
#define hash __hash
#define union _union
const double pi = acos(-1.0);
const int Mod = 1009;
const int maxn = 262145*2;

struct WZP{
	int rev[maxn];
	int n,logn;
	void init(int len){
		n = 1;logn=0;
		while(n < len) n<<=1,logn++;
		Rep(i,1,n) rev[i] = (rev[i>>1] >> 1) | ((i&1) << (logn-1));
//		printf("n = %d\n",n);
	}
	void fft(E a[],int flag){
		rep(i,0,n)if(rev[i] < i)swap(a[i],a[rev[i]]);
		for(RG int i=1;i<n;i<<=1){
			E wn(cos(pi/i),flag*sin(pi/i)),x,y;
			for(RG int j=0;j<n;j+=(i<<1)){
				E w(1,0);
				for(RG int k=0;k<i;++k,w=w*wn){
					x = a[j+k],y = w * a[i+j+k];
					a[j+k] = x+y,a[i+j+k] = x-y;
				}
			}
		}
		if(flag==1) return;
		rep(i,0,n)a[i]/=n;
	}
}wzp;
int n,m,k;
vector<int> V[maxn];
priority_queue<pii,vector<pii>,greater<pii> > Q;
E a[maxn],b[maxn];
int cnt[maxn];
int main(){
	//fin(1);
	n = rd(),m = rd(),k = rd();
	Rep(i,1,n) V[rd()].push_back(1);
	Rep(i,1,m){
		V[i].push_back(1);
		Q.push({V[i].size(),i});
	}
	while(Q.size()>=2){
		int x = Q.top().second;Q.pop();
		int y = Q.top().second;Q.pop();
		for(unsigned i = 0; i < V[x].size();++i) a[i] = V[x][i];
		for(unsigned i = 0; i < V[y].size();++i) b[i] = V[y][i];
//		printf("%d(%d) + %d(%d) = %d(%d)\n",x,V[x].size(),y,V[y].size(),m+1,V[x].size()+V[y].size()-1);
//		for(int i=0;i < V[x].size();++i) printf("%d ",(int)a[i].real());puts("");
//		for(int i=0;i < V[y].size();++i) printf("%d ",(int)b[i].real());puts("");
		wzp.init(V[x].size() + V[y].size()-1);
		wzp.fft(a,1);wzp.fft(b,1);
		for(int i=0;i < wzp.n;++i) a[i] = a[i] * b[i];
		wzp.fft(a,-1);
		++m;
		for(unsigned i = 0;i < V[x].size() + V[y].size() - 1;++i)
			V[m].push_back((ll)(a[i].real()+0.5) % Mod);
		Q.push({V[x].size() + V[y].size() - 1 , m});
		for(unsigned i = 0; i < V[x].size();++i) a[i] = 0;
		for(unsigned i = 0; i < V[y].size();++i) b[i] = 0;
	}
	printf("%d\n",V[m][k]);
	return 0;
}
/*
2 1 1
    1 2
https://github.com/Moeditor/hexo-renderer-moemark-pygments
1 1
1 
*/

