#include <bits/stdc++.h>
using namespace std;
pair<int, int> p[1000005];
int main() {
  int n, k;
  long long l;
  scanf("%d%I64d%d", &n, &l, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &p[i].first);
    p[i].second = i;
  }
  sort(p, p + n);
  vector<vector<int> > dp(k, vector<int>(n));
  for (int i = 0; i < n; i++) dp[0][i] = 1;
  for (int i = 1; i < k; i++) {
    int sum = 0;
    for (int j = 0, t = 0; j < n; j++) {
      while (t < n && p[t].first <= p[j].first) {
        sum = (sum + dp[i - 1][t]) % 1000000007;
        t++;
      }
      dp[i][j] = sum;
    }
  }
  long long ans = 0;
  for (int i = 0; i < k; i++) {
    for (int j = 0; j < n; j++) {
      long long cnt = l / n + (p[j].second < (l % n));
      if (cnt - i > 0)
        ans = (ans + ((cnt - i) % 1000000007) * (dp[i][j] % 1000000007) %
                         1000000007) %
              1000000007;
    }
  }
  printf("%I64d\n", ans);
  return 0;
}
