#include <bits/stdc++.h>
const int modulo = 1000000007;
int n, k;
long long l, m;
int sequence[1000000];
int __dp[1000000];
std::pair<int, int> pairs[1000000];
inline int &dp(int a, int b) { return __dp[a * n + b]; }
int main(void) {
  int i, j, x;
  int sum;
  int answer;
  scanf("%d %I64d %d", &n, &l, &k);
  m = l / n;
  if (l % n) ++m;
  if (k > m) k = m;
  if (l % n) --m;
  for (i = 0; i < n; ++i)
    scanf("%d", &sequence[i]), pairs[i] = std::make_pair(sequence[i], i);
  std::sort(pairs, pairs + n);
  for (i = 0; i < n; ++i) dp(0, i) = 1;
  for (i = 1; i < k; ++i) {
    sum = 0;
    for (j = 0; j < n; ++j) {
      if (!j || pairs[j].first != pairs[j - 1].first) {
        (sum += dp(i - 1, pairs[j].second)) %= modulo;
        x = j;
        while (++x < n && pairs[x].first == pairs[x - 1].first)
          (sum += dp(i - 1, pairs[x].second)) %= modulo;
      }
      dp(i, pairs[j].second) = sum;
    }
  }
  answer = 0;
  for (i = 0; i < l % n; ++i)
    for (j = 0; j < k && m + 1 - j > 0; ++j)
      (answer += 1ll * dp(j, i) * ((m + 1 - j) % modulo) % modulo) %= modulo;
  for (i = l % n; i < n; ++i)
    for (j = 0; j < k && m - j > 0; ++j)
      (answer += 1ll * dp(j, i) * ((m - j) % modulo) % modulo) %= modulo;
  printf("%d\n", answer);
  return 0;
}
