#include <bits/stdc++.h>
using namespace std;
const int N = 1123456, lgN = 22, rootN = 1123;
const double eps = 1e-11, pi = 3.1415926535;
long long cnt(long long l, long long p, long long k, long long n) {
  long long ans = (l / n);
  if (p < l % n) ++ans;
  ans -= (k - 1);
  ans %= 1000000007LL;
  return max(0LL, ans);
}
vector<pair<long long, long long>> vec;
vector<vector<long long>> dp;
int main() {
  long long n, k, l;
  scanf("%lld %lld %lld", &n, &l, &k);
  long long x;
  for (int i = 0; i < n; ++i) {
    scanf("%lld", &x);
    vec.push_back(make_pair(x, i));
  }
  sort(vec.begin(), vec.end());
  dp.resize(n);
  for (int i = 0; i < n; ++i) dp[i].resize(k + 1);
  for (int i = 0; i < n; ++i) dp[i][1] = 1;
  for (int j = 2; j <= k; ++j) {
    long long sum = 0;
    for (int i = 0; i < n; ++i) {
      int last = i;
      while (last < n && vec[i].first == vec[last].first) {
        sum += dp[last][j - 1];
        if (sum >= 1000000007LL) sum -= 1000000007LL;
        ++last;
      }
      --last;
      for (int p = i; p <= last; ++p) dp[p][j] = sum;
      i = last;
    }
  }
  long long ans = 0;
  for (int i = 0; i < n; ++i) {
    int p = vec[i].second;
    for (int j = 1; j <= k; ++j) {
      long long v = dp[i][j];
      long long c = cnt(l, p, j, n);
      ans = (ans + c * v) % 1000000007LL;
    }
  }
  printf("%lld\n", ans);
  return 0;
}
