#include <bits/stdc++.h>
using namespace std;
int pow_mod(int b, int p) {
  int r = 1;
  b %= 1000000007;
  while (p) {
    if (p & 1) r = ((int)((((long long)(r)) * (b)) % 1000000007));
    p >>= 1;
    b = ((int)((((long long)(b)) * (b)) % 1000000007));
  }
  return r;
}
int a[1000000], coun[1000000], b[1000000], pos[1000000];
vector<int> V[1000000];
int main() {
  int n, k, i, N, j, res, ch, ch2;
  long long l, m;
  scanf("%d%I64d%d", &n, &l, &k);
  m = l / n;
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    b[i] = a[i];
  }
  sort(a, a + n);
  N = 0;
  coun[0] = 1;
  for (i = 1; i < n; i++) {
    if (a[i] == a[N]) {
      coun[N]++;
    } else {
      a[++N] = a[i];
      coun[N] = 1;
    }
  }
  N++;
  V[0].push_back(coun[0]);
  for (i = 1; i < k; i++)
    V[0].push_back(
        ((int)((((long long)(coun[0])) * (V[0][i - 1])) % 1000000007)));
  for (j = 1; j < N; j++) {
    V[j].push_back((V[j - 1][0] + coun[j]) % 1000000007);
    for (i = 1; i < k; i++)
      V[j].push_back(
          (V[j - 1][i] +
           ((int)((((long long)(coun[j])) * (V[j][i - 1])) % 1000000007))) %
          1000000007);
  }
  for (i = 0; i < l % n; i++) {
    pos[i] = lower_bound(a, a + N, b[i]) - a;
  }
  res = l % n;
  for (i = 0; i < m && i < k; i++) {
    res = (res + ((int)((((long long)((m - i) % 1000000007)) * (V[N - 1][i])) %
                        1000000007))) %
          1000000007;
    if (i != k - 1)
      for (j = 0; j < l % n; j++) res = (res + V[pos[j]][i]) % 1000000007;
  }
  printf("%d\n", res);
  return 0;
}
