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>
using namespace std;
long long int abss(long long int a) {
  if (a < 0) return -a;
  return a;
}
long long int fast_pow(long long int b, long long int e,
                       long long int width = 1000000007) {
  if (e == 0) {
    return 1;
  } else if (e == 1) {
    return b % width;
  }
  b = b % width;
  long long int ans = 1;
  while (e > 0) {
    if ((e & 1) == 1) {
      ans = (ans * b) % width;
    }
    e >>= 1;
    b = (b * b) % width;
  }
  return ans;
}
long long int mod_inv(long long int a, long long int width = 1000000007) {
  return fast_pow(a, width - 2, width);
}
template <typename Number, Number width>
class ModularArithmetic {
 private:
  Number n;

 public:
  friend ostream &operator<<(ostream &os, ModularArithmetic const &num) {
    return os << num.n;
  }
  friend istream &operator>>(istream &is, ModularArithmetic &num) {
    is >> num.n;
    return is;
  }
  ModularArithmetic() : n(0) {}
  ModularArithmetic(Number n) : n(n % width) {
    if (this->n < 0) this->n += width;
  }
  Number get() const { return n; }
  ModularArithmetic operator+(const ModularArithmetic &b) {
    Number t = (n + b.get()) % width;
    if (t < 0) return ModularArithmetic(width + t);
    return ModularArithmetic(t);
  }
  ModularArithmetic operator-(const ModularArithmetic &b) {
    Number t = (n - b.get()) % width;
    if (t < 0) return ModularArithmetic(width + t);
    return ModularArithmetic(t);
  }
  ModularArithmetic operator*(const ModularArithmetic &b) {
    Number t = (n * b.get()) % width;
    if (t < 0) return ModularArithmetic(width + t);
    return ModularArithmetic(t);
  }
  ModularArithmetic operator/(const ModularArithmetic &b) {
    assert(b.get() != 0);
    Number ans = n * mod_inv(b.get(), width);
    if ((ans) < 0) return ModularArithmetic(width + (ans) % width);
    return ModularArithmetic(ans % width);
  }
  ModularArithmetic &operator+=(const ModularArithmetic &b) {
    n = (n + b.get()) % width;
    if (n < 0) n = n + width;
    return *this;
  }
  ModularArithmetic &operator-=(const ModularArithmetic &b) {
    n = (n - b.get()) % width;
    if (n < 0) n = n + width;
    return *this;
  }
  ModularArithmetic &operator*=(const ModularArithmetic &b) {
    n = (n * b.get()) % width;
    if (n < 0) n = n + width;
    return *this;
  }
  ModularArithmetic &operator/=(const ModularArithmetic &b) {
    assert(b.get() != 0);
    n = (n * mod_inv(b.get(), width)) % width;
    if (n < 0) n = n + width;
    return *this;
  }
};
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
  return os << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &p) {
  os << "[";
  for (auto &it : p) os << it << " ";
  return os << "]";
}
template <class T>
ostream &operator<<(ostream &os, const set<T> &p) {
  os << "[";
  for (auto &it : p) os << it << " ";
  return os << "]";
}
template <class T>
ostream &operator<<(ostream &os, const multiset<T> &p) {
  os << "[";
  for (auto &it : p) os << it << " ";
  return os << "]";
}
template <class S, class T>
ostream &operator<<(ostream &os, const map<S, T> &p) {
  os << "[";
  for (auto &it : p) os << it << " ";
  return os << "]";
}
template <class S, class T>
istream &operator>>(istream &is, const pair<S, T> &p) {
  return is >> p.first >> p.second;
}
template <class T>
istream &operator>>(istream &is, vector<T> &p) {
  for (auto &itr : p) is >> itr;
  return is;
}
template <class T>
void dbs(string str, T t) {
  cerr << str << ":" << t << "\n";
}
template <class T, class... S>
void dbs(string str, T t, S... second) {
  long long int idx = str.find(',');
  cerr << str.substr(0, idx) << ":" << t << ",";
  dbs(str.substr(idx + 1), second...);
}
bool isComposite(long long int a, long long int d, long long int n) {
  long long int res = fast_pow(a, d, n);
  if (res == 1 || res == n - 1) return false;
  while (d != (n - 1)) {
    res = (res * res) % n;
    if (res == n - 1) {
      return false;
    }
  }
  return true;
}
bool MillerRabinDet(long long int n) {
  if (n < 4) return n == 2 || n == 3;
  long long int d = n - 1;
  while (d & 1 == 0) {
    d >>= 1;
  }
  for (long long int a : {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37}) {
    if (a == n) return true;
    if (isComposite(a, d, n)) {
      return false;
    }
  }
  return true;
}
bool MillerRabinNonDet(long long int n, long long int k = 1000) {
  if (n < 4) return n == 2 || n == 3;
  long long int d = n - 1;
  long long int second = 0;
  while (d & 1 == 0) {
    d >>= 1;
    second++;
  }
  long long int a;
  for (long long int i = 0; i < k; i++) {
    a = 2 + rand() % (n - 3);
    if (isComposite(a, d, n)) {
      return false;
    }
  }
  return true;
}
const double PI = acos(-1);
void fft_util(vector<complex<double>> &a, bool invert) {
  long long int n = a.size();
  if (a.size() == 1) return;
  complex<double> w = 1;
  complex<double> wn(cos(2 * PI / n), sin(2 * PI / n));
  if (invert) {
    wn = complex<double>(cos(-2 * PI / n), sin(-2 * PI / n));
  }
  vector<complex<double>> a0, a1;
  for (long long int i = 0; i < n; ++i) {
    if (i % 2 == 0) {
      a0.push_back(a[i]);
    } else {
      a1.push_back(a[i]);
    }
  }
  fft_util(a0, invert);
  fft_util(a1, invert);
  for (long long int i = 0; 2 * i < n; i++) {
    a[i] = a0[i] + w * a1[i];
    a[i + n / 2] = a0[i] - w * a1[i];
    w *= wn;
  }
}
void fft(vector<complex<double>> &arr, bool inv) {
  if (arr.size() == 1) return;
  long long int x = 1;
  while (x < arr.size()) {
    x <<= 1;
  }
  while (arr.size() < x) {
    arr.push_back(complex<double>(0));
  }
  fft_util(arr, inv);
  if (inv) {
    for (auto &itr : arr) {
      itr = (itr / static_cast<double>(arr.size()));
    }
  }
}
long long int n, m, k;
vector<long long int> freq;
vector<vector<complex<double>>> poly;
vector<complex<double>> product;
void solve() {
  cin >> n >> m >> k;
  vector<long long int>(m, 0).swap(freq);
  for (long long int i = 0; i < n; ++i) {
    long long int x;
    cin >> x;
    x--;
    freq[x]++;
  }
  vector<vector<complex<double>>>().swap(poly);
  for (long long int i = 0; i < m; ++i) {
    poly.push_back(vector<complex<double>>());
    for (long long int j = 0; j < freq[i] + 1; ++j) {
      poly.back().push_back(complex<double>(1));
    }
  }
  long long int mx = poly[0].size();
  for (long long int i = 1; i < poly.size(); ++i) {
    mx += poly[i].size();
  }
  for (auto &itr : poly) {
    while (itr.size() < mx) {
      itr.push_back(0);
    }
  }
  for (auto &itr : poly) {
    fft(itr, 0);
  }
  product = poly[0];
  for (long long int i = 1; i < poly.size(); ++i) {
    long long int j;
    for (j = 0; j < min(product.size(), poly[i].size()); j++) {
      product[j] *= poly[i][j];
    }
    for (; j < product.size(); j++) {
      product[j] = 0;
    }
    for (; j < poly[i].size(); j++) {
      product.push_back(0);
    }
  }
  fft(product, 1);
  cout << (round)(product[k].real() -
                  (floor(product[k].real() / 1009.0)) * 1009.0)
       << endl;
}
int main() {
  freopen("err.txt", "w", stderr);
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
