#include <bits/stdc++.h>
using namespace std;
int n, x;
long long l, m, y, z, k, w, g;
int A[1000005];
int B[1000005], C[1000005];
long long DP[1000005], cnt[1000005], ans;
long long mod = 1000000007ll, tmp;
map<int, int> M;
int main() {
  scanf("%d%I64d%I64d", &n, &l, &k);
  for (int i = (0); i < (n); i++) scanf("%d", &A[i]);
  for (int i = (0); i < (n); i++) B[i] = A[i];
  sort(B, B + n);
  for (int i = (n - 1); i >= (0); i--) {
    if (!M[B[i]]) M[B[i]] = i + 1;
  }
  for (int i = (0); i < (n); i++) C[i] = M[A[i]];
  if (1) {
    for (int i = (0); i < (n); i++) cnt[i] = 1ll;
    for (int i = (0); i < (n); i++) {
      w++;
      tmp = l / (long long)(n);
      if (l % (long long)(n) > (long long)(i)) tmp++;
      tmp %= mod;
      ans = (ans + tmp) % mod;
      if (w == l) {
        printf("%I64d\n", ans);
        return 0;
      }
    }
    for (int i = 2; i <= (int)(k); i++) {
      for (int j = (1); j < (n); j++) cnt[j] = (cnt[j] + cnt[j - 1]) % mod;
      for (int j = (n - 2); j >= (0); j--)
        if (B[j] == B[j + 1]) cnt[j] = cnt[j + 1];
      for (int j = (0); j < (n); j++) DP[j] = cnt[C[j] - 1];
      for (int j = (0); j < (n); j++) {
        w++;
        tmp = l / (long long)(n);
        if (l % (long long)(n) > (long long)(j)) tmp++;
        tmp = tmp - (long long)(i) + 1ll;
        tmp %= mod;
        ans = (ans + (tmp * DP[j]) % mod) % mod;
        if (w == l) {
          printf("%I64d\n", ans);
          return 0;
        }
      }
    }
  }
  printf("%I64d\n", ans);
  return 0;
}
