#include <bits/stdc++.h>
using namespace std;
long long min(long long a, long long b) { return a < b ? a : b; }
int main() {
  long long n, k, l;
  scanf("%lld%lld%lld", &n, &l, &k);
  long long a1[n], a2[n];
  for (int i = 0; i < n; i++) {
    scanf("%lld", &a1[i]);
    a2[i] = a1[i];
  }
  sort(a1, a1 + n);
  long long dp[k + 1][n + 1];
  for (int i = 0; i <= k; i++)
    for (int j = 0; j <= n; j++) dp[i][j] = 0;
  for (int i = 0; i <= k; i++)
    for (int j = 1; j <= n; j++) {
      if (i == 0)
        dp[i][j] = 1;
      else {
        long long tmp3 = upper_bound(a1, a1 + n, a1[j - 1]) - a1;
        dp[i][j] = (dp[i][j - 1] % 1000000007 + dp[i - 1][tmp3] % 1000000007) %
                   1000000007;
      }
    }
  long long tmp1 = l / n, tmp2 = l % n, ans = 0;
  for (long long x = 1; x <= min(k, tmp1 + 1); x++) {
    ans = (ans + (dp[x][n] * ((tmp1 - x + 1) % 1000000007)) % 1000000007) %
          1000000007;
    for (long long j = 0; j < tmp2; j++) {
      long long tmp3 = upper_bound(a1, a1 + n, a2[j]) - a1;
      ans = (ans + dp[x - 1][tmp3]) % 1000000007;
    }
  }
  printf("%lld\n", ans);
  return 0;
}
