#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6;
const long long mod = 1e9 + 7;
int arr[MAXN + 5], temp[MAXN + 5], n;
int occ[MAXN + 5];
vector<vector<long long> > dp, acc;
int R;
void Rank() {
  for (int i = 0; i < n; i++) temp[i] = arr[i];
  sort(temp, temp + n);
  map<int, int> rnk;
  R = 1;
  for (int i = 0; i < n; i++) {
    if (rnk.count(temp[i]) == 0) rnk[temp[i]] = R++;
  }
  for (int i = 0; i < n; i++) arr[i] = rnk[arr[i]];
}
int main() {
  int k;
  long long l;
  scanf("%d%I64d%d", &n, &l, &k);
  for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
  Rank();
  for (int i = 0; i < n; i++) occ[arr[i]]++;
  dp.resize(R + 5);
  acc.resize(R + 5);
  for (int i = 0; i < dp.size(); i++) dp[i].resize(k + 5);
  for (int i = 0; i < acc.size(); i++) acc[i].resize(k + 5);
  for (int val = 1; val < R; val++) {
    dp[val][1] = 1;
    acc[val][1] = (dp[val][1] * occ[val] % mod + acc[val - 1][1]) % mod;
  }
  for (int len = 2; len <= k; len++) {
    for (int val = 1; val < R; val++) {
      dp[val][len] = acc[val][len - 1];
      acc[val][len] = (dp[val][len] * occ[val] % mod + acc[val - 1][len]) % mod;
    }
  }
  long long res = 0;
  for (int i = 0; i < n; i++) {
    for (int len = 1; len <= k; len++) {
      long long periods = l / n;
      int last_sz = l % n;
      if (i < last_sz) periods++;
      if (len > periods) continue;
      long long cur = (dp[arr[i]][len] * ((periods - len + 1) % mod)) % mod;
      res += cur;
      res %= mod;
    }
  }
  printf("%I64d\n", res);
}
