#include <bits/stdc++.h>
using namespace std;
const int mod = (int)1e9 + 7;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, k;
  long long l;
  cin >> n >> l >> k;
  vector<int> a(n), val;
  map<int, int> fr;
  map<int, int> id;
  set<int> f;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    fr[a[i]]++;
    f.insert(a[i]);
  }
  for (auto e : fr) {
    val.push_back(e.second);
  }
  int m = (int)val.size();
  vector<vector<int>> dp(m, vector<int>(k));
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < k; j++) {
      if (i == 0) {
        if (j == 0) {
          dp[i][j] = val[i];
        } else {
          dp[i][j] = ((long long)val[i] * dp[i][j - 1]) % mod;
        }
      } else {
        if (j == 0) {
          dp[i][j] = (dp[i - 1][j] + val[i]) % mod;
        } else {
          dp[i][j] =
              (dp[i - 1][j] + ((long long)val[i] * dp[i][j - 1]) % mod) % mod;
        }
      }
    }
  }
  int ans = 0;
  for (int i = 0; i < k; i++) {
    if (i + 1 <= l / n) {
      ans = (ans + (((l / n - i) % mod) * dp[m - 1][i]) % mod) % mod;
    }
  }
  val.clear();
  fr.clear();
  int cnt = 0;
  for (auto e : f) {
    id[e] = cnt++;
  }
  f.clear();
  for (int i = 0; i < l % n; i++) {
    fr[a[i]]++;
    f.insert(a[i]);
  }
  vector<int> value;
  for (auto e : f) {
    value.push_back(e);
  }
  for (auto e : fr) {
    val.push_back(e.second);
  }
  int sm = 0;
  for (auto e : val) {
    sm += e;
  }
  for (int j = 0; j < k; j++) {
    if (l / n + (l % n != 0) >= j + 1) {
      if (j == 0) {
        ans = (ans + sm) % mod;
      } else {
        for (int i = 0; i < (int)val.size(); i++) {
          ans =
              (ans + ((long long)dp[id[value[i]]][j - 1] * val[i]) % mod) % mod;
        }
      }
    }
  }
  cout << ans << '\n';
  return 0;
}
