#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000005;
struct node {
  long long x, idx;
};
bool cmp(node x, node y) {
  if (x.x == y.x) return x.idx < y.idx;
  return x.x < y.x;
}
long long dp[2][maxn], sum[2][maxn], b[maxn];
node a[maxn];
int main() {
  long long n, l, k;
  scanf("%I64d%I64d%I64d", &n, &l, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%I64d", &a[i].x);
    a[i].idx = i;
  }
  sort(a + 1, a + 1 + n, cmp);
  for (int i = n; i >= 1; i--) {
    if (i == n) {
      b[i] = n;
      continue;
    }
    if (a[i].x == a[i + 1].x)
      b[i] = b[i + 1];
    else
      b[i] = i;
  }
  for (int i = 1; i <= n; i++) sum[1][i] = 1;
  long long ans = 0, now = 0, nxt = 1;
  for (long long i = 1; i <= k; i++) {
    if (l / n - i + 1 < 0) break;
    for (long long j = 1; j <= n; j++) {
      dp[now][j] = sum[nxt][b[j]];
      sum[now][j] = (sum[now][j - 1] + dp[now][j]) % 1000000007;
      long long tmp = l / n - i + 1;
      if (a[j].idx <= l % n) tmp++;
      ans = (ans + tmp % 1000000007 * dp[now][j] % 1000000007) % 1000000007;
    }
    swap(nxt, now);
  }
  printf("%I64d", ans);
  return 0;
}
