#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
template <class T>
typename T::value_type arr_sum(const T& v, int n) {
  typename T::value_type sum = 0;
  for (int i = (0); i < (n); ++i) sum += v[i];
  return sum;
}
struct Sync_stdio {
  Sync_stdio() {
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
  }
} _sync_stdio;
int main() {
  int n, k;
  long long l;
  scanf("%d%I64d%d", &n, &l, &k);
  vector<int> a(n);
  for (int i = (0); i < (n); ++i) {
    scanf("%d", &a[i]);
  }
  vector<int> b = a;
  b.resize(l % n);
  sort(b.begin(), b.end());
  sort(a.begin(), a.end());
  vector<int> pos(n);
  for (int i = (0); i < (n); ++i) {
    pos[i] = i;
  }
  for (int i = (n - 2); i > (-1); --i) {
    if (a[i] == a[i + 1]) {
      pos[i] = pos[i + 1];
    }
  }
  vector<vector<long long>> dp(k + 1, vector<long long>(n));
  for (int i = (0); i < (n); ++i) {
    dp[0][i] = 1;
  }
  for (int i = (1); i < (k + 1); ++i) {
    for (int j = (0); j < (n); ++j) {
      dp[i][j] = dp[i - 1][pos[j]];
      dp[i][j] %= MOD;
      if (j > 0) {
        dp[i][j] += dp[i][j - 1];
        dp[i][j] %= MOD;
      }
    }
  }
  long long ans = 0;
  long long cnt1 = l / n;
  for (int i = (1); i < (k + 1); ++i) {
    if ((cnt1 - i + 1) < 0) {
      continue;
    }
    ans += ((cnt1 - i + 1) % MOD) * dp[i][n - 1];
    ans %= MOD;
  }
  long long t = l % n;
  for (int i = (0); i < (k); ++i) {
    for (int j = (0); j < (t); ++j) {
      if (cnt1 - i < 0) {
        continue;
      }
      int p = upper_bound(a.begin(), a.end(), b[j]) - a.begin() - 1;
      ans += dp[i][p];
      ans %= MOD;
    }
  }
  printf("%d", ans);
}
