#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 4, MOD = 1e9 + 7;
int arr[N], c[N], n, k, ran[N], d[N], pref[N], A[N], sum[N], ans, i, h;
long long l, m;
int main() {
  ios::sync_with_stdio();
  cin.tie(0);
  cout.tie(0);
  cin >> n >> l >> k;
  int dp[n + 5][k + 5];
  for (i = 0; i < n; i++) cin >> arr[i], c[i] = arr[i];
  sort(c, c + n);
  for (i = 0; i < n; i++) d[i] = ran[i] = lower_bound(c, c + n, arr[i]) - c;
  sort(d, d + n);
  A[n - 1] = n - 1;
  for (i = n - 2; i >= 0; i--) A[i] = (d[i] == d[i + 1] ? A[i + 1] : i);
  m = (l) / n;
  for (i = 0; i < n; i++) dp[i][1] = 1, pref[i] = i + 1;
  sum[1] = n;
  for (h = 2; h <= k; h++) {
    for (i = 0; i < n; i++) {
      dp[i][h] = pref[A[i]];
      sum[h] = (sum[h] + dp[i][h]) % MOD;
    }
    for (i = 0; i < n; i++) {
      pref[i] = dp[i][h];
      if (i) pref[i] = (pref[i] + pref[i - 1]) % MOD;
    }
  }
  if ((long long)k > m) h = (int)m;
  for (i = 1; i <= h; i++)
    ans = (1ll * ans + 1ll * sum[i] % MOD * (m % MOD - i + 1) % MOD) % MOD;
  l -= m * n;
  ans = (ans + l % MOD) % MOD;
  for (h = 2; h <= k; h++) {
    if (m + 1 >= h) {
      for (i = 0; i < l; i++) ans = (ans + dp[ran[i]][h]) % MOD;
    }
  }
  cout << (ans % MOD + MOD) % MOD;
}
