#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
const long long LINF = 1LL << 50;
const int M = 1e6 + 10;
const double PI = acos(-1.0);
const double eps = 1e-6;
int seq[M], seq2[M];
long long dp[2][M];
const int MOD = 1e9 + 7;
int main() {
  long long n, l, k;
  scanf("%I64d %I64d %I64d", &n, &l, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &seq[i]);
    seq2[i] = seq[i];
  }
  sort(seq2, seq2 + n);
  for (int i = 0; i < n; i++)
    seq[i] = lower_bound(seq2, seq2 + n, seq[i]) - seq2;
  int maxn = 0;
  for (int i = 0; i < n; i++) maxn = max(maxn, seq[i]);
  maxn++;
  long long c = l / n, d = l % n;
  for (int i = 0; i < d; i++) seq2[i] = seq[i];
  long long ans = 0;
  int id = 0;
  for (int i = 0; i < min(c, k); i++) {
    id ^= 1;
    for (int j = 0; j <= maxn; j++) dp[id][j] = 0;
    for (int j = 0; j < n; j++)
      dp[id][seq[j]] = (dp[id][seq[j]] + dp[id ^ 1][seq[j]] + 1) % MOD;
    for (int j = 1; j < maxn; j++)
      dp[id][j] = (dp[id][j] + dp[id][j - 1]) % MOD;
    ans = (ans + dp[id][maxn - 1]) % MOD;
  }
  if (c > k) ans = (ans + dp[id][maxn - 1] * ((c - k) % MOD)) % MOD;
  int t = id;
  if (c >= k) t ^= 1;
  for (int i = 0; i < d; i++) {
    ans += dp[t][seq2[i]] + 1;
    ans %= MOD;
  }
  cout << ans << endl;
  return 0;
}
