#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long l, ans;
map<int, int> id;
long long sum[1010000], tank[1010000];
int A[1010000], n, k, tp;
int main() {
  scanf("%d%I64d%d", &n, &l, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &A[i]);
    id[A[i]] = 1;
  }
  tp = 0;
  for (map<int, int>::iterator i = id.begin(); i != id.end(); i++)
    i->second = ++tp;
  for (int i = 1; i <= tp; i++) sum[i] = 1;
  for (int i = 0; i < n; i++) A[i] = id[A[i]];
  for (int x = 1; x <= k; x++) {
    for (int i = 0; i < n; i++) {
      tank[i] = sum[A[i]];
      if (i < (l % n)) {
        if (((l / (long long)n) % mod + 1LL - (long long)x + 1LL) > 0)
          ans += sum[A[i]] *
                 ((l / (long long)n) % mod + 1LL - (long long)x + 1LL) % mod;
      } else {
        if ((l / (long long)n - (long long)x + 1LL) > 0)
          ans +=
              sum[A[i]] * ((l / (long long)n - (long long)x + 1LL) % mod) % mod;
      }
      ans %= mod;
    }
    for (int i = 1; i <= tp; i++) sum[i] = 0;
    for (int i = 0; i < n; i++) sum[A[i]] += tank[i], sum[A[i]] %= mod;
    for (int i = 1; i <= tp; i++) sum[i] += sum[i - 1], sum[i] %= mod;
  }
  printf("%I64d\n", ans);
  return 0;
}
