#include <bits/stdc++.h>
#pragma comment(linker, "/STATK:134217728")
using namespace std;
const int MOD = (int)1e9 + 7;
int n, k;
long long L;
int a[1 << 20];
int t[1 << 20];
int cnt[1 << 20];
map<int, int> M;
long long f[1 << 20];
long long inv[1 << 20];
long long powmod(long long a, int x) {
  if (x == 0) return 1;
  if (x & 1) return a * powmod(a * a % MOD, x / 2) % MOD;
  return powmod(a * a % MOD, x / 2);
}
vector<vector<long long> > dp;
long long go(int pos, int k) {
  if (pos < 0) return k == 0;
  long long& res = dp[pos][k];
  if (res != -1) return res;
  res = go(pos - 1, k);
  if (k > 0) res = (res + cnt[pos] * go(pos, k - 1)) % MOD;
  return res;
}
int main() {
  f[0] = 1;
  for (int i = 1; i < 1 << 20; ++i) f[i] = f[i - 1] * i % MOD;
  for (int i = 0; i < 1 << 20; ++i) inv[i] = powmod(f[i], MOD - 2);
  scanf("%d%I64d%d", &n, &L, &k);
  long long have = L / n;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
    t[i] = a[i];
  }
  sort(t, t + n);
  for (int i = 0; i < n; ++i) M[t[i]] = i;
  for (int i = 0; i < n; ++i) a[i] = M[a[i]];
  for (int i = 0; i < n; ++i) cnt[a[i]]++;
  long long res = 0;
  dp = vector<vector<long long> >(n + 1, vector<long long>(k + 1, -1));
  for (int i = 1; i <= k; ++i) {
    if (i > have) break;
    long long mul = (have - i + 1) % MOD;
    res = (res + mul * go(n, i)) % MOD;
  }
  int m = L % n;
  for (int i = 0; i < m; ++i) {
    for (int j = 0; j <= k - 1; ++j) {
      if (j > have) break;
      res = (res + go(a[i], j)) % MOD;
    }
  }
  printf("%I64d\n", res);
  return 0;
}
