#include <bits/stdc++.h>
using namespace std;
const int ms = 1e6 + 12;
const int mod = 1000000007;
vector<vector<long long>> dp;
long long a[ms], b[ms];
map<long long, int> id;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  long long n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    b[i] = a[i];
  }
  sort(a, a + n);
  for (int i = 0; i < n; ++i) {
    id[a[i]] = i;
  }
  dp = vector<vector<long long>>(n + 1, vector<long long>(k + 1, 0ll));
  dp[0][0] = 1;
  for (int j = 1; j <= k; ++j) {
    long long sum = 0, l = 0;
    for (int i = 0; i < n; ++i) {
      while (l < n && a[l] <= a[i]) sum = (sum + dp[l][j - 1]) % mod, l++;
      dp[i][j] = sum;
    }
  }
  long long tk = min(k, m / n);
  long long res = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 1; j <= tk; ++j) {
      res = (res + (dp[i][j] * ((m / n - j + 1) % mod)) % mod) % mod;
    }
  }
  long long top = m % n;
  tk = min(k, m / n + 1);
  for (int i = 0; i < top; ++i) {
    int ti = id[b[i]];
    for (int j = 1; j <= tk; ++j) {
      res = (res + dp[ti][j]) % mod;
    }
  }
  cout << res << "\n";
  return 0;
}
