#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:10240000000,10240000000")
using namespace std;
const int N = 1000010;
const long long mod = 1e9 + 7;
int mp[N] = {0};
int a[N], b[N], aIndex[N], bIndex[N];
long long n, l, k, m;
long long sum[N], now[N], len[N], last[N];
int find(int x) {
  int l = 1, r = m;
  while (r >= l) {
    int mid = (r + l) / 2;
    if (b[mid] == x)
      return mid;
    else if (b[mid] > x)
      r = mid - 1;
    else
      l = mid + 1;
  }
  return -1;
}
int main() {
  cin >> n >> l >> k;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    b[i] = a[i];
  }
  if (n >= l) {
    cout << l << endl;
    return 0;
  }
  sort(b + 1, b + n + 1);
  m = unique(b + 1, b + n + 1) - (b + 1);
  long long ans = 0;
  memset(len, 0, sizeof(len));
  memset(now, 0, sizeof(now));
  for (int i = 1; i <= n; i++) {
    bIndex[i] = find(b[i]);
    aIndex[i] = find(a[i]);
    mp[aIndex[i]]++;
  }
  for (int j = 1; j <= k; j++) {
    if (j == 1)
      sum[0] = 1;
    else
      sum[0] = 0;
    for (int i = 1; i <= m; i++) {
      sum[i] = (sum[i - 1] + now[i] * mp[bIndex[i]]) % mod;
      now[i] = sum[i];
      len[i] = (len[i] + now[i]) % mod;
    }
    if (j * n > l) {
      int up = l - (j - 1) * n;
      for (int i = 1; i <= up; i++) {
        int in = aIndex[i];
        ans = (ans + len[in]) % mod;
      }
      cout << ans << endl;
      return 0;
    }
    for (int i = 1; i <= n; i++) {
      int in = aIndex[i];
      ans = (ans + last[in]) % mod;
    }
    for (int i = 1; i <= n; i++) {
      last[i] = len[i];
    }
    for (int i = 1; i <= m; i++) {
      ans = (ans + now[i] * mp[bIndex[i]]) % mod;
    }
  }
  l -= n * k;
  long long y = l / n;
  for (int i = 1; i <= m; i++) {
    ans = (ans + y % mod * len[i] % mod * mp[bIndex[i]]) % mod;
  }
  int t = l % n;
  for (int i = 1; i <= t; i++) {
    ans = (ans + len[aIndex[i]]) % mod;
  }
  cout << ans << endl;
  return 0;
}
