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

#include<bits/stdc++.h>
#define ri register int
using namespace std;
typedef long long ll;
#define pb push_back
const int rlen=1<<18|1;
char buf[rlen],*ib=buf,*ob=buf;
#define gc() (((ib==ob)&&(ob=(ib=buf)+fread(buf,1,rlen,stdin)),ib==ob)?-1:*ib++)
inline int read() {
  int ans=0;
  char ch=gc();
  while(!isdigit(ch)) ch=gc();
  while(isdigit(ch)) ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
  return ans;
}
struct cp {
  double x,y;
  cp(double x=0,double y=0):x(x),y(y) {}
  friend inline cp operator+(cp a,cp b) { return cp(a.x+b.x,a.y+b.y); }
  friend inline void operator+=(cp&a,cp b) { a=a+b; }
  friend inline cp operator-(cp a,cp b) { return cp(a.x-b.x,a.y-b.y); }
  friend inline void operator-=(cp&a,cp b) { a=a-b; }
  friend inline cp operator*(cp a,cp b) { return cp(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x); }
  friend inline void operator*=(cp&a,cp b) { a=a*b; }
  friend inline cp operator/(cp a,double b) { return cp(a.x/b,a.y/b); }
  friend inline void operator/=(cp&a,double b) { a=a/b; }
};
typedef vector<cp> poly;
int lim,tim;
cp w[23];
vector<int>rev[23];
const double pi=acos(-1.0);
inline void init_fft() { for(ri i=22;~i;--i) w[i]=cp(cos(pi/(1<<i)),sin(pi/(1<<i))); }
inline void init(int up) {
  lim=1,tim=0;
  while(lim<up) lim<<=1,++tim;
  if(rev[tim].size()) return;
  rev[tim].resize(lim);
  for(ri i=1;i<lim;++i) rev[tim][i]=(rev[tim][i>>1]>>1)|((i&1)<<(tim-1));
}
inline void fft(poly&a,int typ) {
  for(ri i=1;i<lim;++i) if(i<rev[tim][i]) swap(a[i],a[rev[tim][i]]);
  cp a0,a1,mt;
  for(ri i=1,t=0;i<lim;i<<=1,++t) for(ri j=0,len=i<<1;j<lim;j+=len) {
    mt=cp(1,0);
    for(ri k=0;k<i;++k,mt*=w[t]) {
      a0=a[j+k],a1=a[j+k+i]*mt;
      a[j+k]=a0+a1,a[j+k+i]=a0-a1;
    }
  }
  if(~typ) return;
  reverse(++a.begin(),a.end());
  for(ri i=0;i<lim;++i) a[i]/=lim;
}
inline poly operator*(poly a,poly b) {
  int n=(int)a.size(),m=(int)b.size(),t=n+m-1;
  if(t<=500) {
    poly c(t);
    for(ri i=0;i<n;++i) for(ri j=0;j<m;++j) c[i+j]+=a[i]*b[j];
    for(ri i=0;i<t;++i) c[i].x=(double)(((ll)(c[i].x+0.5))%1009);
    return c;
  }
  init(t);
  a.resize(lim),fft(a,1);
  b.resize(lim),fft(b,1);
  for(ri i=0;i<lim;++i) a[i]*=b[i];
  fft(a,-1);
  a.resize(t);
  for(ri i=0;i<t;++i) a[i].x=(double)(((ll)(a[i].x+0.5))%1009);
  return a;
}
const int N=2e5+5;
int n,m,K,a[N],vl[N],cnt[N],sig=0;
inline int find(int x) { return lower_bound(vl+1,vl+sig+1,x)-vl; }
inline poly getpoly(int x) { return poly(x+1,cp(1,0)); }
inline poly solve(int l,int r) {
  if(l==r) return getpoly(cnt[l]);
  int mid=l+r>>1;
  return solve(l,mid)*solve(mid+1,r);
}
int main() {
  #ifdef ldxcaicai
  freopen("lx.in","r",stdin);
  #endif
  init_fft();
  n=read(),m=read(),K=read();
  for(ri i=1;i<=n;++i) a[i]=vl[++sig]=read();
  sort(vl+1,vl+sig+1),sig=unique(vl+1,vl+sig+1)-vl-1;
  for(ri i=1;i<=n;++i) ++cnt[find(a[i])];
  cout<<(ll)(solve(1,sig)[K].x+0.5)%1009;
  return 0;
}