#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long max_n = 1e6 + 20;
long long n, l, k, maxi;
map<long long, long long> mp, cnt;
map<pair<long long, long long>, long long> dp;
vector<long long> vec, sec;
long long save[max_n];
long long pw(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = (ret * a) % MOD;
    b <<= 1;
    a = (a * a) % MOD;
  }
  return ret;
}
void init() {
  save[1] = 1;
  for (long long i = 2; i < max_n; i++) save[i] = (save[i - 1] * i) % MOD;
  for (long long i = 1; i <= k; i++)
    for (long long j = 0; j < sec.size(); j++) {
      if (i == 1) {
        dp[{i, sec[j]}] = cnt[sec[j]];
        if (j != 0)
          dp[{i, sec[j]}] = (dp[{i, sec[j]}] + dp[{i, sec[j - 1]}]) % MOD;
        continue;
      } else {
        if (j == 0)
          dp[{i, sec[j]}] = (cnt[sec[0]] * dp[{i - 1, sec[j]}]) % MOD;
        else
          dp[{i, sec[j]}] =
              (cnt[sec[j]] * dp[{i - 1, sec[j]}] + dp[{i, sec[j - 1]}]) % MOD;
      }
    }
}
long long cal(long long v) {
  if (l < (v - 1) * n) return 0;
  l -= (v - 1) * n;
  long long z = l / n;
  z %= MOD;
  long long ret = (z * dp[{v, maxi}]) % MOD;
  for (long long i = 0; i < l % n; i++)
    if (v != 1)
      ret = (ret + dp[{v - 1, vec[i]}]) % MOD;
    else
      ret = (ret + 1) % MOD;
  return ret;
}
int main() {
  scanf("%I64d%I64d%I64d", &n, &l, &k);
  vec.resize(n);
  for (long long i = 0; i < n; i++) {
    scanf("%I64d", &vec[i]);
    cnt[vec[i]]++;
    maxi = max(maxi, vec[i]);
  }
  sec.assign(vec.begin(), vec.end());
  sort(sec.begin(), sec.end());
  sec.resize(unique(sec.begin(), sec.end()) - sec.begin());
  init();
  long long ans = 0;
  long long secl = l;
  for (long long i = 1; i <= k; i++) {
    l = secl;
    ans = (ans + cal(i)) % MOD;
  }
  printf("%I64d\n", ans);
  return 0;
}
