#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e6 + 5;
const long long mod = 1e9 + 7;
const long long inf = 1e18;
long long n, l, k, a[maxn], b[maxn], ps[maxn];
vector<long long> dp[maxn], vec;
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> l >> k;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    b[i] = a[i];
    dp[1].push_back(1);
    vec.push_back(a[i]);
  }
  sort(b, b + n);
  sort(vec.begin(), vec.end());
  vec.resize(unique(vec.begin(), vec.end()) - vec.begin());
  long long cur = vec.size() - 1;
  for (long long i = n - 1; i >= 0; i--) {
    while (cur) {
      if (vec[cur - 1] >= b[i])
        cur--;
      else
        break;
    }
    ps[cur]++;
  }
  for (long long i = 1; i < (long long)vec.size(); i++)
    ps[i] = (ps[i] + ps[i - 1]);
  for (long long i = 2; i <= k; i++) {
    for (long long j = 0; j < n; j++) {
      long long x = lower_bound(vec.begin(), vec.end(), a[j]) - vec.begin();
      dp[i].push_back(ps[x]);
    }
    for (long long i = 0; i < (long long)vec.size(); i++) ps[i] = 0;
    for (long long j = 0; j < n; j++) {
      long long x = lower_bound(vec.begin(), vec.end(), a[j]) - vec.begin();
      ps[x] = (ps[x] + dp[i][j]) % mod;
    }
    for (long long i = 1; i < (long long)vec.size(); i++)
      ps[i] = (ps[i] + ps[i - 1]) % mod;
  }
  long long ans = 0, cnt = (l / n);
  for (long long i = 1; i <= k; i++) {
    for (long long j = 0; j < n; j++) {
      if (cnt + 1 < i) continue;
      if ((cnt + 1) > i) {
        ans = (ans + (dp[i][j] * ((cnt - i + 1) % mod) % mod)) % mod;
      }
      if (j >= l % n)
        continue;
      else if (cnt * n != l) {
        ans = (ans + dp[i][j]) % mod;
      }
    }
  }
  cout << ans << endl;
}
