#include <bits/stdc++.h>
using namespace std;
const int N = 1100000;
const int mod = 1e9 + 7;
int a[N], b[N], cnt[N], sum[N];
vector<vector<int>> dp;
void add(int &u, int v) {
  u += v;
  if (u >= mod) u -= mod;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  long long l;
  cin >> n >> l >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) b[i - 1] = a[i];
  sort(b, b + n);
  int m = unique(b, b + n) - b;
  for (int i = 1; i <= n; i++) a[i] = lower_bound(b, b + m, a[i]) - b + 1;
  dp.resize(k + 1);
  for (int i = 0; i <= k; i++) dp[i].resize(m + 1);
  for (int i = 0; i <= k; i++)
    for (int j = 0; j <= m; j++) dp[i][j] = 0;
  for (int i = 1; i <= n; i++) cnt[a[i]]++;
  for (int i = 1; i <= n; i++) dp[1][a[i]]++;
  for (int i = 1; i <= m; i++) add(dp[1][i], dp[1][i - 1]);
  for (int i = 2; i <= k; i++) {
    for (int j = 1; j <= m; j++)
      dp[i][j] = (long long)dp[i - 1][j] * cnt[j] % mod;
    for (int j = 1; j <= m; j++) add(dp[i][j], dp[i][j - 1]);
  }
  long long how = l / n;
  int ans = 0;
  for (int i = 1; i <= k; i++) {
    if (how - i + 1 >= 0) {
      add(ans, (long long)dp[i][m] * ((how - i + 1) % mod) % mod);
    }
  }
  for (int i = 1; i <= l % n; i++) {
    for (int j = 1; j <= min<long long>(k - 1, how); j++) {
      add(ans, dp[j][a[i]]);
    }
    add(ans, 1);
  }
  cout << ans << endl;
  return 0;
}
