#include <bits/stdc++.h>
using namespace std;
long long int m = 1e9 + 7;
int main() {
  ios_base::sync_with_stdio(false);
  long long int n, l, k;
  cin >> n >> l >> k;
  vector<vector<long long int> > dp(n + 1, vector<long long int>(k + 1));
  vector<long long int> a(n + 1);
  vector<long long int> pos(n + 1);
  vector<pair<long long int, long long int> > p;
  vector<long long int> mul(n + 1);
  for (int i = 0; i <= n - 1; i++) {
    cin >> a[i];
    p.push_back(make_pair(a[i], i));
  }
  sort(p.begin(), p.end());
  long long int mu = l / n, re = l % n;
  int ptr = 0;
  for (int i = 0; i <= n - 1; i++) {
    while (ptr < n - 1 && p[ptr + 1].first <= p[i].first) ptr++;
    pos[i] = ptr;
    dp[i][0] = 1;
    if (p[i].second < re)
      mul[i] = mu + 1;
    else
      mul[i] = mu;
  }
  long long int ans = 0;
  for (int j = 1; j <= k; j++) {
    for (int i = 0; i <= n - 1; i++) {
      dp[i][j] = dp[pos[i]][j - 1];
      long long int t = mul[i];
      t -= (j - 1);
      if (t < 0) t = 0;
      t %= m;
      ans = (ans + t * dp[i][j]) % m;
      if (i) dp[i][j] += dp[i - 1][j];
      dp[i][j] %= m;
    }
  }
  cout << ans;
  return 0;
}
