#include <bits/stdc++.h>
using namespace std;
const int P = 1000000007;
const int N = 1123456;
long long l;
int n, m, u;
int a[N], v[N], c[N], f[N];
void upd(int& x, int y) {
  x += y;
  if (x >= P) x -= P;
}
int main() {
  cin >> n >> l >> m;
  for (int i = 0; i < n; ++i) scanf("%d", a + i), v[i] = a[i];
  sort(v, v + n);
  u = unique(v, v + n) - v;
  for (int i = 0; i < n; ++i) a[i] = lower_bound(v, v + u, a[i]) - v + 1;
  long long s = l / n;
  int ans = 0;
  int ed = (int)min((long long)m, s + 1);
  for (int j = 0; j < ed; ++j) {
    for (int i = 1; i < u + 1; ++i) c[i] = 0;
    for (int i = 0; i < n; ++i)
      for (int x = a[i]; x <= u; x += x & -x) upd(c[x], f[i]);
    for (int i = 0; i < n; ++i) {
      f[i] = j == 0;
      for (int x = a[i]; x > 0; x -= x & -x) upd(f[i], c[x]);
      if (j < s) ans = (ans + (s - j) % P * f[i]) % P;
      if (ans < 0) ans += P;
      if (i < l % n) upd(ans, f[i]);
    }
  }
  printf("%d\n", ans);
  return 0;
}
