#include <bits/stdc++.h>
using namespace std;
int n, k;
long long l;
int a[1000000];
long long dp[2000000];
map<int, int> cnt, id;
int main() {
  scanf("%d %I64d %d", &n, &l, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    cnt[a[i]]++;
  }
  if (k == 1) {
    printf("%I64d\n", l % 1000000007);
    return 0;
  }
  if (l <= n) {
    printf("%I64d\n", l);
    return 0;
  }
  vector<int> nums;
  for (map<int, int>::iterator it = cnt.begin(); it != cnt.end(); it++) {
    nums.push_back(it->first);
  }
  sort(nums.begin(), nums.end());
  vector<int> freq;
  for (int i = 0; i < nums.size(); i++) {
    freq.push_back(cnt[nums[i]]);
  }
  memset(dp, 0, sizeof(dp));
  int r = nums.size();
  long long ans = 0;
  long long multi = l / n;
  for (int i = 0; i < nums.size(); i++) {
    dp[r + i] = freq[i];
    ans += (dp[r + i] * multi) % 1000000007;
    ans %= 1000000007;
  }
  for (int x = 2; x <= min(multi, (long long)k); x++) {
    long long run = 0;
    for (int i = 0; i < nums.size(); i++) {
      run += dp[r * (x - 1) + i];
      dp[r * x + i] = (run * freq[i]) % 1000000007;
      ans += (dp[r * x + i] * ((multi - x + 1) % 1000000007)) % 1000000007;
      ans %= 1000000007;
    }
  }
  for (int i = 0; i < nums.size(); i++) {
    id[nums[i]] = i;
  }
  vector<int> freq2;
  for (int i = 0; i < nums.size(); i++) {
    freq2.push_back(0);
  }
  long long left = l % n;
  for (int i = 0; i < left; i++) {
    freq2[id[a[i]]]++;
  }
  ans += left;
  for (int i = 0; i < nums.size(); i++) {
    long long sum = 0;
    for (int x = 1; x < k; x++) {
      sum += dp[x * r + i];
      sum %= 1000000007;
    }
    ans += (sum * left) % 1000000007;
    ans %= 1000000007;
    left -= freq2[i];
  }
  printf("%I64d\n", ans);
  return 0;
}
