#include <bits/stdc++.h>
using namespace std;
const int INF = int(1e9);
const long long INFll = 1ll * INF * INF;
const int MOD = 1000000007;
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int n;
  long long l;
  int k;
  cin >> n >> l >> k;
  vector<pair<int, int> > a(n);
  for (int i = 0; i < n; ++i) cin >> a[i].first, a[i].second = i;
  sort(a.begin(), a.end());
  vector<int> pos(n);
  pos[0] = 0;
  int cur = 0;
  for (int i = 1; i < n; ++i)
    if (a[i].first != a[i - 1].first)
      pos[i] = i, cur = i;
    else
      pos[i] = cur;
  vector<vector<int> > f(k, vector<int>(n));
  for (int i = 0; i < n; ++i) f[0][i] = 1;
  vector<int> add(n);
  for (int i = 0; i < k; ++i) {
    int cadd = 0;
    for (int j = 0; j < n; ++j) {
      cadd = (cadd + add[j]) % MOD;
      f[i][j] = (f[i][j] + cadd) % MOD;
      add[j] = 0;
      add[pos[j]] = (add[pos[j]] + f[i][j]) % MOD;
    }
  }
  int ans = 0;
  for (int i = 0; i < k; ++i) {
    for (int j = 0; j < n; ++j) {
      long long d = l / n;
      int num = l % n - 1;
      d += (num >= a[j].second);
      if (d >= i + 1) ans = (ans + 1ll * (d - i) % MOD * f[i][j]) % MOD;
    }
  }
  cout << ans;
  if (0) cerr << "\nTIME = " << clock() << "\n";
  return 0;
}
