#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
long long MOD = 1009;
long double EPS = 1e-9;
long long binpow(long long b, long long p, long long mod) {
  long long ans = 1;
  b %= mod;
  for (; p; p >>= 1) {
    if (p & 1) ans = ans * b % mod;
    b = b * b % mod;
  }
  return ans;
}
void pre() {}
struct cp {
  double x, y;
};
inline cp operator+(const cp u, const cp v) {
  return (cp){u.x + v.x, u.y + v.y};
}
inline cp operator-(const cp u, const cp v) {
  return (cp){u.x - v.x, u.y - v.y};
}
inline cp operator*(const cp u, const cp v) {
  return (cp){u.x * v.x - u.y * v.y, u.x * v.y + u.y * v.x};
}
namespace FFT {
double pi = atan2(0, -1), pipi = pi * 2;
cp W[1050000];
int dp[1050000];
void fft(cp* a, int n) {
  dp[0] = 0;
  for (register int i = 1, j; i < (1 << n); ++i) {
    dp[i] = j = i & 1 ? dp[i - 1] + (1 << n - 1) : dp[i >> 1] >> 1;
    if (i < j) swap(a[i], a[j]);
  }
  for (int b = 0; b < n; ++b) {
    int len1 = 1 << b, len2 = 1 << b + 1;
    int w, w0 = (1 << n) / len2;
    for (int i = 0; i < (1 << n); i += len2) {
      cp *l = a + i, *r = a + i + len1, tmp;
      w = 0;
      for (register int j = 0; j < len1; ++j) {
        tmp = r[j] * W[w];
        r[j] = l[j] - tmp;
        l[j] = l[j] + tmp;
        w += w0;
      }
    }
  }
}
void realmain(cp* a, cp* b, int la, int lb) {
  int n = 0;
  for (; la + lb >= (1 << n);) ++n;
  for (register int i = la + 1; i < (1 << n); ++i) a[i] = (cp){0, 0};
  for (register int i = lb + 1; i < (1 << n); ++i) b[i] = (cp){0, 0};
  W[0] = (cp){1., 0.};
  for (int i = 1; i < (1 << n); ++i) {
    if ((i & 3) == 1 || 1)
      W[i] = (cp){cos(pipi / (1 << n) * i), sin(pipi / (1 << n) * i)};
    else
      W[i] = W[i - 1] * W[1];
  }
  fft(a, n);
  fft(b, n);
  for (int i = 0; i < (1 << n); ++i) a[i] = a[i] * b[i];
  reverse(a + 1, a + (1 << n));
  fft(a, n);
  for (int i = 0; i < (1 << n); ++i) a[i].x /= (1 << n), a[i].y /= (1 << n);
}
};  // namespace FFT
int n, m;
cp aa[277100], bb[277100];
vector<long long> mul(vector<long long>& a, vector<long long>& b,
                      bool mm = true) {
  vector<long long> res(a.size() + b.size() - 1);
  for (long long i = 0; i < (a.size()); ++i) aa[i] = cp({(double)a[i], 0});
  n = a.size() - 1;
  for (long long i = 0; i < (b.size()); ++i) bb[i] = cp({(double)b[i], 0});
  m = b.size() - 1;
  FFT::realmain(aa, bb, n, m);
  for (long long i = 0; i < (a.size() + b.size() - 1); ++i) {
    res[i] = round(aa[i].x);
    if (mm) res[i] %= MOD;
  }
  return res;
}
vector<long long> binpow(vector<long long> b, long long p) {
  vector<long long> ans = {1};
  for (; p; p >>= 1) {
    if (p & 1) ans = mul(ans, b);
    b = mul(b, b);
  }
  return ans;
}
vector<long long> dnc(vector<long long>& base, int l, int r) {
  if (l == r) {
    vector<long long> temp(base[l] + 1, 1);
    return temp;
  }
  int mid = (l + r) >> 1;
  vector<long long> xx = dnc(base, l, mid);
  vector<long long> yy = dnc(base, mid + 1, r);
  return mul(xx, yy);
}
void solve() {
  long long n, m, k;
  cin >> n >> m >> k;
  map<int, int> mp;
  for (long long i = 1; i <= n; ++i) {
    long long x;
    cin >> x;
    mp[x]++;
  }
  vector<long long> base;
  for (auto v : mp) {
    base.emplace_back(v.second);
  }
  sort((base).begin(), (base).end());
  cout << dnc(base, 0, base.size() - 1)[k] << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  pre();
  long long _t = 1;
  for (long long i = 1; i <= _t; i++) {
    solve();
  }
}
