#include <bits/stdc++.h>
using namespace std;
map<long long, long long> s, g;
long long a[1000006], b[1000006], num[1000006], mod = 1e9 + 7, n, l, k;
unordered_map<long long, long long> d[1000006], c[1000006];
int main() {
  cin >> n >> l >> k;
  for (long long i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
    s[a[i]]++;
  }
  long long tot = 1;
  for (auto x : s) {
    b[tot] = x.first;
    num[tot++] = x.second;
  }
  long long sz = n;
  n = tot - 1;
  for (long long j = 1; j <= n; j++) {
    d[1][j] = num[j];
  }
  c[1][1] = d[1][1];
  for (long long j = 2; j <= n; j++) {
    c[1][j] = c[1][j - 1] + d[1][j];
  }
  for (long long i = 2; i <= k; i++) {
    for (long long j = 1; j <= n; j++) {
      d[i][j] = (c[i - 1][j] % mod * num[j] % mod) % mod;
    }
    c[i][1] = d[i][1] % mod;
    for (long long j = 2; j <= n; j++) {
      c[i][j] = (c[i][j - 1] % mod + d[i][j] % mod) % mod;
    }
  }
  long long v = l / sz, p = l % sz, x = (l + sz - 1) / sz, ans = l % mod;
  for (long long i = 1; i <= p; i++) {
    long long pos = upper_bound(b + 1, b + 1 + n, a[i]) - b - 1;
    g[pos]++;
  }
  for (long long i = 2; i <= k && i <= x; i++) {
    if (i <= v) {
      long long k = (v - i + 1) % mod;
      ans = (ans % mod + c[i][n] % mod * k % mod) % mod;
    }
    for (auto j : g) {
      ans = (ans % mod + c[i - 1][j.first] % mod * j.second % mod) % mod;
    }
  }
  cout << ans % mod << endl;
}
