#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 10;
const long long int md = 1e9 + 7;
long long int n, k, l, dp[2][MAXN], prs[2][MAXN], a[MAXN], ans = 0, m;
map<int, int> mp;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> l >> k;
  m = l / n;
  set<int> st;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    st.insert(a[i]);
  }
  int pt = 0;
  while (!st.empty()) mp[*st.begin()] = pt, pt++, st.erase(*st.begin());
  ans = l % md;
  for (int i = 0; i < n; i++) dp[0][i] = 1ll, prs[0][mp[a[i]]]++;
  for (int i = 1; i < pt; i++) prs[0][i] += prs[0][i - 1], prs[0][i] %= md;
  for (int i = 1; i < k; i++) {
    int ii = i % 2, i2 = (i + 1) % 2;
    for (int j = 0; j < pt; j++) prs[ii][j] = 0;
    for (int j = 0; j < n; j++) {
      dp[ii][j] = prs[i2][mp[a[j]]],
      prs[ii][mp[a[j]]] = (prs[ii][mp[a[j]]] + dp[ii][j]) % md;
      long long int tmp = (max(m - i, 0ll) + (l % n > j && m >= i)) % md;
      ans += ((tmp * dp[ii][j]) % md);
      ans %= md;
    }
    for (int j = 0; j < pt; j++)
      prs[ii][j] = (prs[ii][j] + (j > 0 ? prs[ii][j - 1] : 0ll)) % md;
  }
  cout << ans << endl;
  return 0;
}
