#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int a[1100000];
long long sm[2][1100000];
vector<int> vls;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, k;
  long long l;
  cin >> n >> l >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    vls.push_back(a[i]);
  }
  sort(vls.begin(), vls.end());
  vector<int>::iterator it;
  it = unique(vls.begin(), vls.end());
  vls.resize(distance(vls.begin(), it));
  for (int i = 0; i < n; i++)
    a[i] = (lower_bound(vls.begin(), vls.end(), a[i]) - vls.begin()) + 1;
  memset(sm, 0, sizeof sm);
  long long tot = 0;
  sm[1][0] = 1;
  sm[0][0] = 1;
  for (int j = 1; j <= n; j++) {
    sm[1][j] += sm[1][j - 1];
    sm[1][j] %= MOD;
    sm[0][j] += sm[1][j];
    sm[0][j] %= MOD;
  }
  for (int i = 0; i < k; i++) {
    for (int j = 0; j <= n; j++) sm[1][j] = 0;
    for (int j = 0; j < n; j++)
      if (i * n + j < l) {
        sm[1][a[j]] += sm[0][a[j]];
        sm[1][a[j]] %= MOD;
        if (i == k - 1) {
          long long mul = (l / n + (j < (l % n)) - k + 1) % MOD;
          tot += (sm[0][a[j]] * mul) % MOD;
          tot %= MOD;
        } else {
          tot += sm[0][a[j]];
          tot %= MOD;
        }
      }
    for (int j = 1; j <= n; j++) {
      sm[1][j] += sm[1][j - 1];
      sm[1][j] %= MOD;
      sm[0][j] = sm[1][j] + 1;
      sm[0][j] %= MOD;
    }
  }
  cout << tot << endl;
  return 0;
}
