#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e6 + 100;
const int M = 1e9 + 7;
long long int a[maxN], where[maxN];
vector<int> tartib, nums[maxN];
vector<pair<int, int> > v;
long long int n, k, l, ans, t, remain;
long long int p[maxN], sum[maxN];
void input() {
  cin >> n >> l >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    v.push_back(make_pair(a[i], i));
  }
  sort(v.begin(), v.end());
}
void alg() {
  for (int i = 0; i < v.size(); i++) {
    tartib.push_back(v[i].second);
    int now = i + 1;
    where[v[i].second] = v[i].second;
    if (now >= v.size()) break;
    while (v[i].first == v[now].first) {
      nums[v[i].second].push_back(v[now].second);
      where[v[now].second] = v[i].second;
      now++;
      if (now >= v.size()) break;
    }
    i = now - 1;
  }
}
void init() {
  for (int i = 0; i <= n; i++) p[i] = 1;
}
int main() {
  ios::sync_with_stdio(false);
  input();
  alg();
  t = l / n;
  remain = l - t * n;
  init();
  long long int ppp = t;
  if (remain > 0) ppp++;
  for (int j = 1; j <= min(k, ppp); j++) {
    for (int i = 1; i <= n; i++) {
      ans += (((t - j + 1) % M) * p[i]) % M;
      if (i <= remain) ans += p[i];
      ans %= M;
    }
    for (int i = 0; i < tartib.size(); i++) {
      sum[tartib[i]] =
          (long long)(nums[tartib[i]].size() + 1) * p[tartib[i]] % M;
      sum[tartib[i]] %= M;
      if (i > 0) sum[tartib[i]] += sum[tartib[i - 1]];
      sum[tartib[i]] %= M;
    }
    for (int i = 1; i <= n; i++) {
      p[i] = sum[where[i]];
    }
  }
  cout << ans << endl;
  return 0;
}
