#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e6 + 10, MOD = 1e9 + 7;
int *D[MAX_N];
int *F[MAX_N];
pair<int, int> A[MAX_N];
int P[MAX_N];
inline int add(int a, int b) {
  a += b;
  return a >= MOD ? a - MOD : a;
}
int main() {
  int N, K;
  long long L;
  scanf(
      "%d"
      "%lld"
      "%d",
      &N, &L, &K);
  for (int i = 0; i < (N); ++i) scanf("%d", &A[i].first), A[i].second = i;
  sort(A, A + N);
  for (int i = (N)-1; i >= 0; --i)
    if (i < N - 1 && A[i].first == A[i + 1].first)
      P[i] = P[i + 1];
    else
      P[i] = i;
  for (int i = 0; i < (K); ++i) {
    D[i] = new int[N + 3]();
    F[i] = new int[N + 3]();
    for (int j = 0; j < (N); ++j) {
      D[i][j] = add((i ? F[i - 1][P[j] + 1] : 0), 1);
      F[i][j + 1] = add(F[i][j], D[i][j]);
    }
  }
  if (L <= N * K) {
    int ans = 0;
    for (int i = 0; i < (K); ++i)
      for (int j = 0; j < (N); ++j)
        if (i * N + A[j].second < L) ans = add(ans, D[i][j]);
    printf("%d\n", ans);
  } else {
    int ans1 = 0, ans2 = 0;
    long long cnt = (L - N * (K - 1)) / N;
    for (int i = 0; i < (K - 1); ++i)
      for (int j = 0; j < (N); ++j) ans1 = add(ans1, D[i][j]);
    for (int j = 0; j < (N); ++j) ans2 = add(ans2, D[K - 1][j]);
    ans1 = int((ans1 + (cnt % MOD) * (ans2 % MOD)) % MOD);
    L %= N;
    for (int j = 0; j < (N); ++j)
      if (A[j].second < L) {
        ans1 = add(ans1, D[K - 1][j]);
      }
    printf("%d\n", ans1);
  }
  return 0;
}
