#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
vector<vector<int> > memo;
vector<vector<bool> > used;
vector<int> val, freq;
int mode;
int dp(int last, int cur) {
  if (last == -1) {
    if (mode) return cur == 0;
    return 1;
  }
  if (used[last][cur]) return memo[last][cur];
  used[last][cur] = 1;
  int &dev = memo[last][cur] = dp(last - 1, cur);
  if (cur - 1 >= 0)
    dev = ((long long)dev +
           (long long)freq[last] * (long long)dp(last, cur - 1)) %
          MOD;
  return dev;
}
int main() {
  ios_base ::sync_with_stdio(0);
  int n, K;
  long long L;
  while (cin >> n) {
    cin >> L >> K;
    vector<int> A(n);
    for (int i = 0; i < n; i++) cin >> A[i];
    vector<int> B = A;
    val.clear();
    freq.clear();
    sort(B.begin(), B.end());
    for (int i = 0; i < ((int)(B).size()); i++) {
      int ind = -1;
      for (int j = i; j < ((int)(B).size()); ++j)
        if (B[i] == B[j])
          ind = j;
        else
          break;
      val.push_back(B[i]);
      freq.push_back(ind - i + 1);
      i = ind;
    }
    long long g = L / n;
    memo = vector<vector<int> >(((int)(val).size()) + 5, vector<int>(K + 5));
    used = vector<vector<bool> >(((int)(val).size()) + 5, vector<bool>(K + 5));
    mode = 1;
    int ans = 0;
    for (int len = 1; len <= min(g, (long long)K); ++len)
      ans = ((long long)ans + (long long)((g - len + 1) % MOD) *
                                  (long long)dp(((int)(val).size()) - 1, len)) %
            MOD;
    used = vector<vector<bool> >(((int)(val).size()) + 5, vector<bool>(K + 5));
    mode = 0;
    int lvl = (int)min(g, (long long)K - 1);
    for (int i = 0; i < (int)(L % n); i++) {
      int pos = lower_bound(val.begin(), val.end(), A[i]) - val.begin();
      ans = ans + dp(pos, lvl);
      if (ans >= MOD) ans -= MOD;
    }
    cout << ans << '\n';
  }
}
