#include <bits/stdc++.h>
using namespace std;
const int mm = 1000000007;
long long len, c, w;
int now, pre, i, j, k, n, m, f[2][1100001], a[1100001], b[1100001], p[1100001],
    tmp, ans;
bool cmp(int x, int y) { return a[x] < a[y]; }
int main() {
  scanf("%d%I64d%d", &n, &len, &m);
  w = len / n;
  for (i = 1; i <= n; i++) scanf("%d", &a[i]);
  now = 0;
  pre = 1;
  for (i = 1, b[0] = 0; i <= n; i++) f[now][i] = 1, b[++b[0]] = 1, p[i] = i;
  sort(p + 1, p + 1 + n, cmp);
  for (i = 2; i <= m; i++) {
    now ^= 1;
    pre ^= 1;
    for (j = 1, k = tmp = 0; j <= n; j++) {
      for (; k < n && a[p[k + 1]] <= a[p[j]];)
        tmp = (tmp + f[pre][p[++k]]) % mm;
      f[now][p[j]] = tmp;
    }
    for (j = 1; j <= n; j++) b[++b[0]] = f[now][j];
  }
  for (i = 1, k = ans = 0; i <= m; i++)
    for (j = 1; j <= n; j++) {
      tmp = b[++k];
      c = w + ((j <= len % n) ? 1 : 0);
      if (c < i) continue;
      ans = (ans + (long long)((c - i + 1) % mm) * (long long)tmp % mm) % mm;
    }
  printf("%d\n", ans);
  return 0;
}
