#include <bits/stdc++.h>
using namespace std;
const int M = 1e6 + 5, P = 1e9 + 7;
long long n, k, m, res, l, T, ans, mi;
int dp[2][M], A[M], B[M], sum[M];
template <class T>
void Rd(T& res) {
  char c;
  res = 0;
  while (c = getchar(), !isdigit(c))
    ;
  do res = (res << 3) + (res << 1) + (c ^ 48);
  while (c = getchar(), isdigit(c));
}
int main() {
  Rd(n);
  Rd(l);
  Rd(k);
  for (int i = 1; i <= n; i++) {
    Rd(A[i]);
    B[i] = A[i];
  }
  sort(B + 1, B + 1 + n);
  m = unique(B + 1, B + 1 + n) - B - 1;
  for (int i = 1; i <= n; i++) A[i] = lower_bound(B + 1, B + 1 + m, A[i]) - B;
  T = l / n;
  res = l % n;
  for (int i = 1; i <= n; i++) dp[1][A[i]]++;
  ans = l % P;
  for (int i = 1; i <= m; i++) dp[1][i] += dp[1][i - 1], sum[i] = dp[1][i];
  ;
  for (int lop = 2; lop <= min(1ll * k, T); lop++) {
    int c = lop & 1;
    for (int i = 1; i <= m; i++) dp[c][i] = 0;
    for (int i = 1; i <= n; i++)
      dp[c][A[i]] = (1ll * dp[c][A[i]] + 1ll * dp[!c][A[i]]) % P;
    for (int i = 1; i <= m; i++) {
      dp[c][i] = (1ll * dp[c][i] + 1ll * dp[c][i - 1]) % P;
      if (lop < k) sum[i] = (1ll * sum[i] + 1ll * dp[c][i]) % P;
    }
    long long len = (T - lop + 1) % P;
    ans = (1ll * ans + 1ll * len * dp[c][m]) % P;
  }
  if (k >= 2 && T >= 1)
    for (int i = 1; i <= res; i++) ans = (1ll * ans + 1ll * sum[A[i]]) % P;
  printf("%d", ans);
}
