#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
const int M = 1e6 + 7;
const int lim = 2e6;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
int n, m, k, a[N], dp[N];
long long l;
pair<int, int> c[N];
int main() {
  scanf("%d%lld%d", &n, &l, &k);
  m = n * k;
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < m; i++) {
    c[i].first = a[i % n];
    c[i].second = i;
  }
  sort(c, c + m);
  long long tot = l / n, ans = l % mod;
  int yu = l % n;
  for (int i = 0; i < m; i++) {
    int id = c[i].second;
    if (id / n == 0)
      dp[id / n + 1]++;
    else
      dp[id / n + 1] = (dp[id / n + 1] + dp[id / n]) % mod;
    if (id >= l) continue;
    if (id <= l && id / n > 0) {
      long long cnt = tot - id / n;
      if (id % n <= yu - 1) cnt++;
      ans = (ans + cnt % mod * dp[id / n] % mod) % mod;
    }
  }
  printf("%lld\n", ans);
  return 0;
}
