#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6;
const long long M = N;
const long long K = 1e6;
const long long MK = 1e6;
long long a[N], b[M], c[M], c1[M];
long long dp[MK];
long long m, k;
long long idx(long long i, long long x) {
  assert(0 <= i && i < m);
  assert(1 <= x && x <= k);
  return i * k + x - 1;
}
int main() {
  long long n, l;
  cin >> n >> l >> k;
  for (long long i = 0; i <= n - 1; i++) {
    cin >> a[i];
    b[i] = a[i];
  }
  sort(b, b + n);
  long long j = 0;
  c[0] = 1;
  for (long long i = 1; i <= n - 1; i++) {
    if (b[i] == b[j]) {
      c[j]++;
    } else {
      j++;
      b[j] = b[i];
      c[j] = 1;
    }
  }
  m = j + 1;
  sort(a, a + (l % n));
  j = 0;
  for (long long i = 0; i <= (l % n) - 1; i++) {
    if (a[i] == b[j]) {
      c1[j]++;
    } else {
      assert(a[i] > b[j]);
      while (a[i] > b[j]) {
        j++;
      }
      assert(a[i] == b[j]);
      c1[j]++;
    }
  }
  for (long long i = 0; i <= m - 1; i++) {
    dp[idx(i, 1)] = c[i];
  }
  for (long long x = 2; x <= k; x++) {
    long long sum = 0;
    for (long long i = 0; i <= m - 1; i++) {
      sum = (sum + dp[idx(i, x - 1)]) % 1000000007LL;
      dp[idx(i, x)] = (c[i] * sum) % 1000000007LL;
    }
  }
  long long ans = 0;
  for (long long x = 1; x <= k; x++) {
    if ((l / n) >= x - 1) {
      if (x == 1) {
        for (long long i = 0; i <= m - 1; i++) {
          ans = (ans + c1[i]) % 1000000007LL;
        }
      } else {
        long long sum = 0;
        for (long long i = 0; i <= m - 1; i++) {
          sum = (sum + dp[idx(i, x - 1)]) % 1000000007LL;
          ans = (ans + c1[i] * sum) % 1000000007LL;
        }
      }
      if ((l / n) >= x) {
        for (long long i = 0; i <= m - 1; i++) {
          ans = (ans + (((l / n) - x + 1) % 1000000007LL) * dp[idx(i, x)]) %
                1000000007LL;
        }
      }
    }
  }
  cout << ans << '\n';
}
