#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
const int mod = 1000000007;
map<int, int> mp;
int a[N], b[N], pp[N], p[N];
long long dp[N + N], s[N + N];
int main() {
  int n, k;
  long long l;
  scanf("%d%I64d%d", &n, &l, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    b[i] = a[i];
  }
  sort(b, b + n);
  int tt = 1;
  for (int i = 0; i < n; i++) {
    if (mp[b[i]] == 0) mp[b[i]] = tt++;
  }
  for (int i = 0; i < n; i++) a[i] = mp[a[i]];
  for (int i = 0; i < n; i++) pp[a[i]]++;
  int nn = n;
  n = tt - 1;
  for (int i = 1; i <= n; i++) {
    dp[i * (k + 1) + 1] = pp[i];
    s[i * (k + 1) + 1] = s[(i - 1) * (k + 1) + 1] + pp[i];
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 2; j <= k; j++) {
      dp[i * (k + 1) + j] = (1ll * pp[i] * s[i * (k + 1) + j - 1]) % mod;
      s[i * (k + 1) + j] =
          (dp[i * (k + 1) + j] + s[(i - 1) * (k + 1) + j]) % mod;
    }
  }
  long long ans = 0;
  long long t = l / nn;
  for (int i = 1; i <= k; i++) {
    if (i > t) break;
    ans += (1ll * (t - i + 1) % mod) * s[n * (k + 1) + i] % mod;
    ans %= mod;
  }
  long long r = l % nn;
  if (r != 0) {
    ans += r;
    ans %= mod;
    for (int i = 0; i < r; i++) {
      for (int j = 1; j < k; j++) {
        if (j > t) break;
        ans += s[a[i] * (k + 1) + j];
        ans %= mod;
      }
    }
  }
  printf("%I64d\n", ans);
  return 0;
}
