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

import java.io.*;
import java.util.*;

public class Main{
	static int maxn=300000,MOD=1009;
	static double[] wR = new double[maxn],
            wI = new double[maxn],
            rR = new double[maxn],
            rI = new double[maxn],
            aR = new double[maxn],
            aI = new double[maxn]; //$
	static int n, k, lastk = -1, dp[] = new int[maxn];
 
    static void fft(boolean inv) {
        if (lastk != k) {
            lastk = k;
            dp[0] = 0;
            for (int i = 1, g = -1; i < n; i++) {
                if ((i & (i - 1)) == 0) {
                    g++;
                }
                dp[i] = dp[i ^ (1 << g)] ^ (1 << (k - 1 - g));
            }
            wR[1] = 1;
            wI[1] = 0;
            for (int t = 0; t < k - 1; t++) {
                double a = Math.PI / n * (1 << (k - 1 - t));
                double curR = Math.cos(a), curI = Math.sin(a);
                int p2 = (1 << t), p3 = p2 * 2;
                for (int j = p2, k = j * 2; j < p3; j++, k += 2) {
                    wR[k] = wR[j];
                    wI[k] = wI[j];
                    wR[k + 1] = wR[j] * curR - wI[j] * curI;
                    wI[k + 1] = wR[j] * curI + wI[j] * curR;
                }
            }
        }
        for (int i = 0; i < n; i++) {
            int d = dp[i];
            if (i < d) {
                double tmp = aR[i];
                aR[i] = aR[d];
                aR[d] = tmp;
                tmp = aI[i];
                aI[i] = aI[d];
                aI[d] = tmp;
            }
        }
        if (inv) {
            for (int i = 0; i < n; i++) {
                aI[i] = -aI[i];
            }
        }
        for (int len = 1; len < n; len <<= 1) {
            for (int i = 0; i < n; i += len) {
                int wit = len;
                for (int it = 0, j = i + len; it < len; it++, i++, j++) {
                    double tmpR = aR[j] * wR[wit] - aI[j] * wI[wit];
                    double tmpI = aR[j] * wI[wit] + aI[j] * wR[wit];
                    wit++;
                    aR[j] = aR[i] - tmpR;
                    aI[j] = aI[i] - tmpI;
                    aR[i] += tmpR;
                    aI[i] += tmpI;
                }
            }
        }
        }
 
    static long[] multiply(long[] a, long[] b) {
        int na = a.length, nb = b.length;
        for (k = 0, n = 1; n < na + nb - 1; n <<= 1, k++) {
        }
        for (int i = 0; i < n; ++i) {
            aR[i] = i < na ? a[i] : 0;
            aI[i] = i < nb ? b[i] : 0;
        }
        fft(false);
        aR[n] = aR[0];
        aI[n] = aI[0];
        double q = -1.0 / n / 4.0;
        for (int i = 0; i <= n - i; ++i) {
            double tmpR = aR[i] * aR[i] - aI[i] * aI[i];
            double tmpI = aR[i] * aI[i] * 2;
            tmpR -= aR[n - i] * aR[n - i] - aI[n - i] * aI[n - i];
            tmpI -= aR[n - i] * aI[n - i] * -2;
            aR[i] = -tmpI * q;
            aI[i] = tmpR * q;
            aR[n - i] = aR[i];
            aI[n - i] = -aI[i];
        }
	    fft(true);
	    long[] ans = new long[n = na + nb - 1]; // ONLY MOD IF NEEDED
		for (int i = 0; i < n; i++) {
		    ans[i] = Math.round(aR[i]) % MOD;
		}
		return ans;
	}
	static void main() throws Exception{
		int n=sc.nextInt(),m=sc.nextInt(),k=sc.nextInt();
		int[]occ=new int[m];
		for(int i=0;i<n;i++) {
			occ[sc.nextInt()-1]++;
		}
		PriorityQueue<long[]>pq=new PriorityQueue<long[]>((x,y)->x.length-y.length);
		for(int i=0;i<m;i++) {
			if(occ[i]==0)continue;
			long[]cur=new long[occ[i]+1];
			Arrays.fill(cur, 1);
			pq.add(cur);
		}
		while(pq.size()>1) {
			pq.add(multiply(pq.poll(), pq.poll()));
		}
		pw.println(pq.poll()[k]);
	}
    public static void main(String[] args) throws Exception{
        sc=new MScanner(System.in);
        pw = new PrintWriter(System.out);
        int tc=1;
//        tc=sc.nextInt();
        for(int i=1;i<=tc;i++) {
//            pw.printf("Case %d:\n", i);
            main();
        }
        pw.flush();
    }
    static PrintWriter pw;
    static MScanner sc;
    static class MScanner {
        StringTokenizer st;
        BufferedReader br;
        public MScanner(InputStream system) {
            br = new BufferedReader(new InputStreamReader(system));
        }
     
        public MScanner(String file) throws Exception {
            br = new BufferedReader(new FileReader(file));
        }
     
        public String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }
        public int[] intArr(int n) throws IOException {
            int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();
            return in;
        }
        public long[] longArr(int n) throws IOException {
            long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();
            return in;
        }
        public int[] intSortedArr(int n) throws IOException {
            int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();
            shuffle(in);
            Arrays.sort(in);
            return in;
        }
        public long[] longSortedArr(int n) throws IOException {
            long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();
            shuffle(in);
            Arrays.sort(in);
            return in;
        }
        public Integer[] IntegerArr(int n) throws IOException {
            Integer[]in=new Integer[n];for(int i=0;i<n;i++)in[i]=nextInt();
            return in;
        }
        public Long[] LongArr(int n) throws IOException {
            Long[]in=new Long[n];for(int i=0;i<n;i++)in[i]=nextLong();
            return in;
        }
        public String nextLine() throws IOException {
            return br.readLine();
        }
     
        public int nextInt() throws IOException {
            return Integer.parseInt(next());
        }
     
        public double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }
     
        public char nextChar() throws IOException {
            return next().charAt(0);
        }
     
        public long nextLong() throws IOException {
            return Long.parseLong(next());
        }
     
        public boolean ready() throws IOException {
            return br.ready();
        }
     
        public void waitForInput() throws InterruptedException {
            Thread.sleep(3000);
        }
        
    }
    static void shuffle(int[]in) {
        for(int i=0;i<in.length;i++) {
            int idx=(int)(Math.random()*in.length);
            int tmp=in[i];
            in[i]=in[idx];
            in[idx]=tmp;
        }
    }
    static void shuffle(long[]in) {
        for(int i=0;i<in.length;i++) {
            int idx=(int)(Math.random()*in.length);
            long tmp=in[i];
            in[i]=in[idx];
            in[idx]=tmp;
        }
    }
}