#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 1e6 + 10;
long long l;
int cnt = 0;
int n, k;
int a[N], b[N];
vector<long long> f[N], g[N];
long long c[N];
long long m;
long long ret = 0;
void update(int x, long long val) {
  for (; x <= n; x += x & -x) (c[x] += val) %= mod;
}
long long query(int x) {
  long long ret = 0;
  for (; x; x -= x & -x) (ret += c[x]) %= mod;
  return ret;
}
int main() {
  scanf("%d%lld%d", &n, &l, &k);
  for (int i(1); i <= (n); ++i) scanf("%d", a + i), b[i] = a[i];
  sort(b + 1, b + n + 1);
  cnt = unique(b + 1, b + n + 1) - b - 1;
  for (int i(1); i <= (n); ++i)
    a[i] = lower_bound(b + 1, b + cnt + 1, a[i]) - b;
  for (int i(0); i <= (n + 1); ++i) f[i].resize(k + 3), g[i].resize(k + 3);
  for (int i(1); i <= (n); ++i) f[i][1] = 1, update(a[i], 1);
  for (int j(2); j <= (k); ++j) {
    for (int i(1); i <= (n); ++i) f[i][j] = query(a[i]);
    for (int i(0); i <= (n + 1); ++i) c[i] = 0;
    for (int i(1); i <= (n); ++i) update(a[i], f[i][j]);
  }
  for (int i(1); i <= (n); ++i) g[i][1] = f[i][1];
  for (int j(2); j <= (k); ++j)
    for (int i(1); i <= (n); ++i) g[i][j] = (g[i][j - 1] + f[i][j]) % mod;
  m = (l - 1) / (long long)n;
  l -= m * n;
  if (m < k) {
    long long ans = 0;
    for (int i(1); i <= (n); ++i)
      for (int j(1); j <= (m); ++j) ans = (ans + g[i][j]) % mod;
    for (int i(1); i <= (l); ++i) ans = (ans + g[i][m + 1]) % mod;
    printf("%lld\n", ans);
    return 0;
  }
  for (int i(1); i <= (n); ++i)
    for (int j(1); j <= (k); ++j) ret = (ret + g[i][j]) % mod;
  long long mul = 0;
  for (int i(1); i <= (n); ++i) mul = (mul + g[i][k]) % mod;
  m = (m - k + mod) % mod;
  mul = (mul * m) % mod;
  ret = (ret + mul) % mod;
  for (int i(1); i <= (l); ++i) ret = (ret + g[i][k]) % mod;
  printf("%lld\n", ret);
  return 0;
}
