#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
long long n, m, k, l;
long long DP[(1000000) + 2];
long long cnt[(1000000) + 2], cnt1[(1000000) + 2];
long long A[(1000000) + 2];
pair<long long, long long> C[(1000000) + 2];
int main() {
  scanf("%I64d%I64d%I64d", &n, &l, &k);
  long long l1 = l / n, l2 = l % n;
  for (int i = 1; i <= n; ++i) scanf("%I64d", A + i);
  m = n * k;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= k; ++j)
      C[i + (j - 1) * n] = pair<long long, long long>(A[i], i + (j - 1) * n);
  sort(C + 1, C + m + 1);
  for (int i = 1; i <= m; ++i) {
    long long id = C[i].second;
    if (id <= n)
      DP[i] = 1;
    else
      DP[i] = (cnt[(id - 1) / n] + 1) % (1000000007);
    cnt[(id - 1) / n + 1] = (cnt[(id - 1) / n + 1] + DP[i]) % (1000000007);
    if ((id - 1) % n + 1 <= l2)
      cnt1[(id - 1) / n + 1] = (cnt1[(id - 1) / n + 1] + DP[i]) % (1000000007);
  }
  long long ans = 0;
  for (int i = 1; i <= k; ++i) {
    if (l1 - i < 0) break;
    ans = (ans + (cnt[i] - cnt[i - 1]) * ((l1 - i + 1) % (1000000007))) %
          (1000000007);
  }
  if (l2) ans += cnt1[min(l1 + 1, k)];
  cout << (ans % (1000000007) + (1000000007)) % (1000000007);
  return 0;
}
