#include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
int dp[1100007];
int main() {
  int n, k;
  long long int l;
  scanf("%d%I64d%d", &n, &l, &k);
  vector<int>(v);
  for (int i = (0); i < ((n)); ++i) {
    int(a);
    scanf("%d", &(a));
    ;
    (v).push_back(a);
  };
  vector<pair<int, int> > w;
  for (int i = (0); i < (n); ++i) w.push_back(make_pair(v[i], i));
  sort((w).begin(), (w).end());
  for (int i = (0); i < (n); ++i) dp[0 * n + i] = 1;
  for (int i = (1); i < (k); ++i) {
    int suma = 0;
    int lastj = 0;
    int j = 0;
    while (j != n) {
      while (j < n && w[j].first == w[lastj].first) {
        suma += dp[(i - 1) * n + w[j].second];
        suma %= mod;
        j++;
      }
      for (int u = (lastj); u < (j); ++u) {
        dp[i * n + w[u].second] = suma;
      }
      lastj = j;
    }
  }
  long long int pelne = l / n, reszta = l % n;
  int answer = 0;
  for (int i = (0); i < (k); ++i) {
    long long int mozl = max(pelne - i, 0LL);
    int dupa = 0;
    int dupa2 = 0;
    for (int j = (0); j < (n); ++j) {
      dupa += dp[i * n + j];
      dupa %= mod;
      if (j < reszta) {
        dupa2 += dp[i * n + j];
        dupa2 %= mod;
      }
    }
    mozl = mozl % mod;
    answer += (mozl * 1LL * dupa) % mod;
    answer %= mod;
    if (pelne >= i) {
      answer += dupa2;
      answer %= mod;
    }
  }
  printf("%d\n", answer);
}
