#include <bits/stdc++.h>
using namespace std;
long long n, l, k, ans, c, sum;
long long C[1 << 20], K[1 << 20], A[1 << 23], S[1 << 20];
struct nn {
  long long val;
  bool f;
} N[1 << 20];
bool comp(nn na, nn nb) { return na.val < nb.val; }
int main() {
  long long i, j;
  scanf("%I64d%I64d%I64d", &n, &l, &k);
  for (i = 0; i < n; i++)
    scanf("%I64d", C + i), N[i].val = C[i], N[i].f = i < l % n;
  sort(C, C + n);
  sort(N, N + n, comp);
  for (i = 0; i < n; i++) {
    K[i] = upper_bound(C, C + n, C[i]) - C;
  }
  for (j = 0; j < n; j++) A[(1) * (n + 2) + (j)] = 1;
  for (i = 2; i <= k; i++) {
    S[0] = A[(i - 1) * (n + 2) + (0)];
    for (j = 1; j < n; j++)
      S[j] = (A[(i - 1) * (n + 2) + (j)] + S[j - 1]) % 1000000007;
    for (j = 0; j < n; j++) {
      A[(i) * (n + 2) + (j)] = S[K[j] - 1];
    }
  }
  for (i = 1; i <= k; i++) {
    for (j = 0; j < n; j++) {
      c = 0;
      if ((l / n) >= i) c = (l / n - i + 1) % 1000000007;
      ans = (ans + A[(i) * (n + 2) + (j)] * c) % 1000000007;
    }
  }
  for (j = 0; j < n; j++) {
    if (N[j].f) {
      for (i = 1; i <= k; i++) {
        if (i > l / n + 1) break;
        ans = (ans + A[(i) * (n + 2) + (j)]) % 1000000007;
      }
    }
  }
  printf("%I64d\n", ans);
  return 0;
}
