#include <bits/stdc++.h>
using namespace std;
long long n, k, a[1000100];
int link[1000100];
long long l;
vector<vector<long long> > v, t;
vector<pair<long long, long long> > s;
long long ans;
long long mod(long long a, long long b) {
  if (b == 0) return 0;
  if (b % 2 == 0) return (2 * mod(a, b / 2)) % 1000000007;
  return (a + mod(a, b - 1)) % 1000000007;
}
int main() {
  cin >> n >> l >> k;
  for (int i = 0; i < n; i++) {
    int q;
    scanf("%i", &q);
    a[i] = (long long)q;
    vector<long long> temp;
    temp.assign(k + 5, 0);
    v.push_back(temp);
    t.push_back(temp);
    s.push_back(make_pair(a[i], i));
  }
  sort(s.begin(), s.end());
  link[s.size() - 1] = s.size() - 1;
  int temp = s.size() - 1;
  for (int i = s.size() - 2; i >= 0; i--) {
    if (s[i].first < s[i + 1].first) temp = i;
    link[i] = temp;
  }
  for (long long i = 0; i < n; i++) {
    v[i][1] = 1;
    t[i][1] = i + 1;
  }
  for (long long i = 2; i <= k; i++) {
    for (long long j = 0; j < n; j++) {
      v[s[j].second][i] = t[link[j]][i - 1] % 1000000007;
    }
    for (long long j = 0; j < n; j++) {
      if (j > 0)
        t[j][i] = (v[s[j].second][i] + t[j - 1][i]) % 1000000007;
      else
        t[j][i] = v[s[j].second][i] % 1000000007;
    }
  }
  for (long long i = 0; i < l % n; i++) {
    for (long long j = 1; j <= min(k, (l - 1) / n + 1); j++) {
      ans = (ans + v[i][j]) % 1000000007;
    }
  }
  long long sz = l / n;
  for (long long i = 1; i <= min(k, sz); i++) {
    long long temp = 0;
    for (long long j = 0; j < n; j++) {
      temp = (temp + v[j][i]);
    }
    temp = mod(temp, sz - i + 1) % 1000000007;
    ans = (ans + temp) % 1000000007;
  }
  ans = ans % 1000000007;
  cout << ans;
  return 0;
}
