#include <bits/stdc++.h>
using namespace std;
long long n, m, x, y, z, e, ans, l, k, b[1000100], h[1000100], mod = 1e9 + 7,
                                                               dp[1000100];
pair<long long, long long> a[1000100];
vector<long long> v[1000100];
map<long long, long long> mp;
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> l >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i].first;
    a[i].second = i;
    b[i] = a[i].first;
  }
  sort(b, b + n);
  unique(b, b + n);
  for (int i = 0; i < n; i++) {
    mp[b[i]] = i;
    if (b[i] >= b[i + 1] || i == n - 1) {
      m = i + 1;
      break;
    }
  }
  fill(b, b + n, 0);
  for (int i = 0; i < n; i++) {
    a[i].first = mp[a[i].first];
    b[a[i].first]++;
  }
  for (long long i = 0; i < m; i++) {
    y = 1;
    for (long long j = 1; j <= k; j++) {
      (((y += (dp[j - 1]) % mod) %= mod) *= b[i]) %= mod;
      v[i].push_back(y % mod);
    }
    for (long long j = 1; j <= k; j++) {
      (dp[j] += (v[i][j - 1] % mod)) %= mod;
    }
  }
  e = l / n;
  for (long long i = 1; i <= k; i++) {
    if (e < i) break;
    ans += ((dp[i] % mod) *
            (((e - i + 1) % mod) + ((e - i + 1) % mod < 0) * mod)) %
           mod;
    ans %= mod;
  }
  if (l % n != 0) {
    for (long long i = 0; i < n; i++) {
      if (a[i].second < l % n) {
        h[a[i].first]++;
      }
    }
    fill(dp, dp + k + 10, 0);
    for (long long i = 0; i < m; i++) {
      dp[0] = 1;
      for (long long j = 1; j <= k; j++) {
        (dp[j] += (v[i][j - 1] % mod)) %= mod;
      }
      for (long long j = 1; j <= k; j++) {
        if (e >= j - 1) (ans += dp[j - 1] * h[i]) %= mod;
      }
    }
  }
  cout << ans;
  return 0;
}
