#include <bits/stdc++.h>
using namespace std;
long long mod = 1000LL * 1000LL * 1000LL + 7;
long long n, k, len;
vector<long long> a, b;
vector<vector<long long> > dp;
void init() {
  cin >> n >> len >> k;
  a.resize(n + 1);
  b.resize(n);
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    b[i - 1] = a[i];
  }
  sort(a.begin(), a.end());
  dp.resize(k + 1, vector<long long>(n + 1, 0));
  for (int i = 1; i <= n; ++i) {
    dp[1][i] = 1;
  }
}
void solve() {
  if (len <= n) {
    cout << len;
    return;
  }
  long long sum = 0;
  int l = 1, r = 1;
  for (int i = 2; i <= k; ++i) {
    sum = 0;
    l = 1;
    r = 1;
    while (l <= n) {
      r = l;
      while (r <= n && a[r] == a[l]) {
        sum = (sum + dp[i - 1][r]) % mod;
        ++r;
      }
      for (int j = l; j < r; ++j) {
        dp[i][j] = (dp[i][j] + sum) % mod;
      }
      l = r;
    }
  }
  long long res = 0, pos = min(len / n, k);
  for (int i = 1; i <= pos; ++i) {
    for (int j = 1; j <= n; ++j) {
      res = (res + (((len / n - i + 1) % mod) * dp[i][j]) % mod) % mod;
    }
  }
  if (len % n > 0) {
    if (len / n < k) {
      pos = len / n + 1;
      for (int i = 1; i <= len % n; ++i) {
        int d =
            std::distance(a.begin(), lower_bound(a.begin(), a.end(), b[i - 1]));
        res = (res + dp[pos][d]) % mod;
      }
    }
    pos = min(len / n, k);
    for (int i = 1; i <= pos; ++i) {
      for (int j = 1; j <= len % n; ++j) {
        int d =
            std::distance(a.begin(), lower_bound(a.begin(), a.end(), b[j - 1]));
        res = (res + dp[i][d]) % mod;
      }
    }
  }
  cout << res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  init();
  solve();
  return 0;
}
