#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> arr[4000006];
long long inp[4000006];
long long dp[4000006];
int main() {
  long long n, l, k;
  scanf("%lld", &n);
  ;
  scanf("%lld", &l);
  ;
  scanf("%lld", &k);
  ;
  long long bl = l / n;
  if (l % n) bl++;
  long long t1, t2;
  for (long long i = 1; i < n + 1; i++) {
    scanf("%lld", &arr[i].first);
    ;
    arr[i].second = i;
  }
  sort(arr + 1, arr + n + 1);
  for (long long i = 0; i < (n + 2) * (k + 2); i++) dp[i] = 0;
  for (long long i = 1; i < n + 1; i++) {
    long long j = i;
    while (j <= n && arr[j].first == arr[i].first) j++;
    for (long long o = i; o < j + 1; o++) inp[arr[o].second] = j - 1;
    i = j - 1;
  }
  for (long long j = 1; j < n + 1; j++) dp[j] = 1;
  for (long long i = 1; i < k + 3; i++) {
    dp[i * n + 1] = dp[(i - 1) * n + 1];
    for (long long j = 2; j < n + 1; j++) {
      dp[i * n + j] = dp[(i - 1) * n + j] + dp[i * n + j - 1];
      if (dp[i * n + j] >= 1000000007LL) dp[i * n + j] -= 1000000007LL;
      if (j == n || arr[j].first != arr[j + 1].first) {
        long long o = j, tmp = arr[j].first;
        while (o > 0 && arr[o].first == tmp) {
          dp[i * n + o] = dp[i * n + j];
          o--;
        }
      }
    }
  }
  long long co = 0LL;
  for (long long i = 0; i < k; i++) {
    if (bl <= i) break;
    co += (dp[(i + 2) * n] * ((bl - i) % 1000000007LL)) % 1000000007LL;
    if (co >= 1000000007LL) co -= 1000000007LL;
    if (l % n == 0) continue;
    for (long long j = n; j > (l % n); j--) {
      long long po = inp[j];
      co -= dp[i * n + po];
      if (co < 0) co += 1000000007LL;
    }
  }
  cout << co << endl;
}
