#include <bits/stdc++.h>
using namespace std;
const int INF = 987654321;
const long long N = 1e6 + 7;
const long long MOD = 1e9 + 7;
vector<int> a;
vector<vector<long long> > f;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.precision(12);
  cout << fixed;
  long long n, l, k;
  cin >> n >> l >> k;
  a = vector<int>(n);
  for (int i = 0; i < n; ++i) cin >> a[i];
  vector<int> idx(n);
  for (int i = 0; i < n; ++i) idx[i] = i;
  sort(idx.begin(), idx.end(), [](const int& i, const int& j) {
    return make_pair(a[i], i) < make_pair(a[j], j);
  });
  f = vector<vector<long long> >(k + 1, vector<long long>(n, 0));
  for (int i = 0; i < n; ++i) f[1][i] = 1;
  for (int i = 2; i <= k; ++i) {
    int pointer = 0;
    long long psum = 0;
    for (int j = 0; j < n; ++j) {
      while (pointer < n && a[idx[pointer]] <= a[idx[j]])
        (psum += f[i - 1][idx[pointer++]]) %= MOD;
      f[i][idx[j]] = psum;
    }
  }
  long long res = 0;
  for (int i = 1; i <= min(l / n, k); ++i)
    for (int j = 0; j < n; ++j)
      (res += f[i][j] * ((l / n - i + 1) % MOD)) %= MOD;
  for (int i = 1; i <= min((l + n - 1) / n, k); ++i)
    for (int j = 0; j < l % n; ++j) (res += f[i][j]) %= MOD;
  cout << res << '\n';
  return 0;
}
