#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 100;
const int M = 2e6 + 100;
const int sq = 100;
const long long int mod = 1e9 + 7;
const int inf = 1e9;
long long int a[N], b[N], dp[M];
vector<pair<int, int>> v;
long long int n, l, k;
inline int id(int x, int y) {
  if (k + 1 > n) return (x * (k + 1) + y);
  return (y * (n + 1) + x);
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> l >> k;
  long long int l1 = l / n, r = l % n, ans = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    b[i] = a[i];
  }
  sort(a, a + n);
  for (int i = 0; i < n;) {
    int j = i;
    while (i < n && a[i] == a[j]) i++;
    v.push_back({a[j], i - j});
  }
  n = v.size();
  for (int i = 0; i < n; i++) {
    int cnt = v[i].second;
    dp[id(i, 0)] = 1;
    for (int j = 1; j <= k; j++) {
      dp[id(i, j)] = (dp[id(i, j - 1)] * cnt) % mod;
      if (i != 0) dp[id(i, j)] += dp[id(i - 1, j)];
      dp[id(i, j)] %= mod;
    }
  }
  for (int x = 1; x <= min(k, l1 + (r != 0)); x++) {
    long long int res = (((l1 - x + 1) % mod) * dp[id(n - 1, x)]) % mod;
    for (int i = 0; i < r; i++) {
      pair<int, int> p = make_pair(b[i], -1);
      int pt = lower_bound(v.begin(), v.end(), p) - v.begin();
      res = (res + dp[id(pt, x - 1)]) % mod;
    }
    ans = (ans + res) % mod;
  }
  cout << ans << endl;
  return 0;
}
