#include <bits/stdc++.h>
using namespace std;
struct item {
  long long a, p;
} s[1000005];
long long dp[2][1000005], sum[2][1000005];
long long n, l, k;
bool cmp(const item &x, const item &y) { return x.a < y.a; }
int main() {
  while (scanf("%I64d %I64d %I64d", &n, &l, &k) != EOF) {
    for (int i = 1; i <= n; i++) {
      scanf("%I64d", &s[i].a);
      s[i].p = i;
    }
    if (l <= n) {
      printf("%I64d\n", l);
      continue;
    }
    sort(s + 1, s + 1 + n, cmp);
    long long nT = l / n, fin = (l - 1) % n + 1;
    if (l % n) nT++;
    int cur = 0, last;
    long long ans = l % 1000000007;
    for (int i = 1; i <= n; i++) {
      dp[cur][i] = 1;
    }
    k = min(k, nT);
    for (int x = 2; x <= k; x++) {
      last = cur;
      cur ^= 1;
      long long sum = 0;
      int pos = 1;
      for (int i = 1; i <= n; i++) {
        while (pos <= n && s[pos].a <= s[i].a) {
          sum = (sum + dp[last][pos++]) % 1000000007;
        }
        dp[cur][i] = sum;
        if (s[i].p <= fin) {
          long long var = (nT - x + 1 + 1000000007) % 1000000007;
          ans = (ans + (dp[cur][i] * var) % 1000000007) % 1000000007;
        } else {
          long long var = (nT - x + 1000000007) % 1000000007;
          ans = (ans + (dp[cur][i] * var) % 1000000007) % 1000000007;
        }
      }
    }
    printf("%I64d\n", ans);
  }
  return 0;
}
