#include <bits/stdc++.h>
using namespace std;
long long a[1000010], f[1000010], p[1000010], mod = 1000000007;
struct node {
  long long x, k;
} K[1000010];
int cmp(const void *xx, const void *yy) {
  node x = *(node *)xx, y = *(node *)yy;
  if (x.x > y.x) return 1;
  return -1;
}
int main() {
  long long n, k, i, j, o, ll, sum, last;
  long long l, ans = 0, Sum = 0, ss;
  scanf("%I64d%I64d%I64d", &n, &l, &k);
  for (i = 1; i <= n; i++) {
    scanf("%I64d", &a[i]);
    K[i].x = a[i];
    K[i].k = i;
  }
  qsort(K + 1, n, sizeof(node), cmp);
  o = l / n;
  l %= n;
  ll = o < k ? o : k;
  for (i = 1; i <= n; i++) f[i] = 1;
  ss = 1;
  for (i = 1; i <= ll; i++) {
    sum = 0;
    last = 1;
    for (j = 1; j <= n; j++) {
      ans =
          (ans + (f[K[j].k] * ((o - i + 1 + (K[j].k <= l)) % mod)) % mod) % mod;
      while (last <= n && K[last].x <= K[j].x)
        sum = (sum + f[K[last++].k]) % mod;
      p[K[j].k] = sum;
    }
    for (j = 1; j <= n; j++) f[j] = p[j];
    ss = (ss * n) % mod;
  }
  if (k > o)
    for (j = n; j >= 1; j--) ans = (ans + f[K[j].k] * (K[j].k <= l)) % mod;
  printf("%I64d\n", ans);
  return 0;
}
