#include <bits/stdc++.h>
using namespace std;
const int N = 1048576;
const int M = 1000000007;
int n, k;
long long l;
map<int, int> id;
int a[N], tn;
int sum[N];
int f[N];
long long ans = 0;
int main(int argc, char const *argv[]) {
  cin >> n >> l >> k;
  for (int i = 0; i < n; ++i) {
    scanf("%d", a + i);
    id[a[i]] = 0;
  }
  for (map<int, int>::iterator i = id.begin(); i != id.end(); ++i)
    i->second = tn++;
  for (int i = 0; i < n; ++i) a[i] = id[a[i]];
  long long r = l / n;
  for (int x = 1; x <= k; ++x) {
    for (int i = 0; i < n; ++i) {
      if (x == 1)
        f[i] = 1;
      else
        f[i] = sum[a[i]];
      if (i < l % n) {
        ans = (ans + (long long)f[i] * (max(0ll, r - x + 2) % M) % M) % M;
      } else
        ans = (ans + (long long)f[i] * (max(0ll, r - x + 1) % M) % M) % M;
    }
    for (int i = 0; i < tn; ++i) sum[i] = 0;
    for (int i = 0; i < n; ++i) {
      sum[a[i]] += f[i];
      sum[a[i]] %= M;
    }
    for (int i = 1; i < tn; ++i) {
      sum[i] += sum[i - 1];
      sum[i] %= M;
    }
  }
  printf("%d\n", (int)ans);
  return 0;
}
