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>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std ;
using namespace __gnu_pbds;

template <typename T> // *s.find_by_order(0), s.order_of_key(2) ;
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define reMin(a, b) a = min(a, b)
#define reMax(a, b) a = max(a, b)

#define lint long long
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define SET(x, val) memset(x, val, sizeof(x))
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)

typedef vector < int > vi ;
typedef pair < int, int > pii ;

const int MOD = 1e9 + 7 ;
const lint INF = 1e18 ;
const int N = 1e6 + 2;

using cd = complex<double>;
const double PI = acos(-1);

namespace FFT {
#define fore(i, a, b) for(int i = (int)(a); i <= (int)(b); ++i)
#define forn(i, n) for(int i = 0; i < (int)(n); ++i)
    typedef long double ld;
    const double PI = acos(-1);
    struct base {
        typedef double T; T re, im;
        base() :re(0), im(0) {}
        base(T re) :re(re), im(0) {}
        base(T re, T im) :re(re), im(im) {}
        base operator + (const base& o) const { return base(re + o.re, im + o.im); }
        base operator - (const base& o) const { return base(re - o.re, im - o.im); }
        base operator * (const base& o) const { return base(re * o.re - im * o.im, re * o.im + im * o.re); }
        base operator * (ld k) const { return base(re * k, im * k) ;}
        base conj() const { return base(re, -im); }
    };
    const int N = 22;
    const int MAXN = (1<<N);
    base w[MAXN];
    base f1[MAXN];
    int rev[MAXN];
    void build_rev(int k) {
        static int rk = -1;
        if( k == rk )return ; rk = k;
        fore(i, 1, (1<<k) ) {
            int j = rev[i-1], t = k-1;
            while( t >= 0 && ((j>>t)&1) ) { j ^= 1 << t; --t; }
            if( t >= 0 ) { j ^= 1 << t; --t; }
            rev[i] = j;
        }
    }
    void fft(base *a, int k) {
        build_rev(k); int n = 1 << k;
        forn(i, n) if( rev[i] > i ) swap(a[i], a[rev[i]]);
        for(int l = 2, ll = 1; l <= n; l += l, ll += ll) {
            if( w[ll].re == 0 && w[ll].im == 0 ) {
                ld angle = PI / ll;
                base ww( cosl(angle), sinl(angle) );
                if( ll > 1 ) for(int j = 0; j < ll; ++j) {
                    if( j & 1 ) w[ll + j] = w[(ll+j)/2] * ww;
                    else w[ll + j] = w[(ll+j)/2];
                } else w[ll] = base(1, 0);
            }
            for(int i = 0; i < n; i += l) forn(j, ll) {
                base v = a[i + j], u = a[i + j + ll] * w[ll + j];
                a[i + j] = v + u; a[i + j + ll] = v - u;
            }
        }
    }
    vi mul(const vi& a, const vi& b) {
        int k = 1;
        while( (1<<k) < (sz(a) + sz(b)) ) ++k;
        int n = (1<<k);
        forn(i, n) f1[i] = base(0,0);
        forn(i, a.size()) f1[i] = f1[i] + base(a[i], 0);
        forn(i, b.size()) f1[i] = f1[i] + base(0, b[i]);
        fft(f1, k);
        forn(i, 1 + n/2) {
            base p = f1[i] + f1[(n-i)%n].conj();
            base _q = f1[(n-i)%n] - f1[i].conj();
            base q(_q.im, _q.re);
            f1[i] = (p * q) * 0.25;
            if( i > 0 ) f1[(n - i)] = f1[i].conj();
        }
        forn(i, n) f1[i] = f1[i].conj();
        fft(f1, k);
        vi r(sz(a) + sz(b));
        forn(i, sz(r) ) {
            r[i] = (lint) (f1[i].re / n + 0.5);
        }
        /*Uncomment for multiplication of two numbers
          int carry = 0;
          for (int i=0; i<sz(r); ++i) {
          r[i] += carry;
          carry = r[i] / 10;
          r[i] %= 10;
          }
          */
        return r;
    }
} 

int n, m, k ;
int cnt[N] ;

int main()
{
    fastio; cin >> n >> m >> k ; SET(cnt, 0); int x ;
    for(int i = 0; i < n; i++) {
        cin >> x ; cnt[x]++ ;
    }
    priority_queue < vi, vector < vi >, greater < vi > > pq ; 
    vi cur, nxt, prod ;

    for(int i = 1; i <= m; i++) {
        if(!cnt[i]) continue ; 
        cur.resize(cnt[i] + 1);
        for(int j = 0; j <= cnt[i]; j++)
            cur[j] = 1 ; 
        pq.push(cur);
    }

    while(sz(pq) > 1) {
        cur = pq.top(); pq.pop();
        nxt = pq.top(); pq.pop();
        prod = FFT :: mul(cur, nxt);
        for(auto &num : prod) num %= 1009 ; 
        pq.push(prod);
    }
    prod = pq.top(); pq.pop();
    cout << prod[k] % 1009 ; 
}