#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
const double EPS = 1e-10;
double zero(double d) { return d < EPS ? 0.0 : d; }
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  return os << '(' << p.first << ',' << p.second << ')';
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &a) {
  os << '[';
  for (int i = 0; i < (int)(a.size()); i++) os << (i ? " " : "") << a[i];
  return os << ']';
}
string toString(int i) {
  stringstream ss;
  ss << i;
  return ss.str();
}
const int MOD = 1000000007;
long long fpow(long long a, long long k, int M) {
  long long res = 1ll;
  long long x = a;
  while (k != 0) {
    if ((k & 1) == 1) res = (res * x) % M;
    x = (x * x) % M;
    k >>= 1;
  }
  return res;
}
int main() {
  cout.setf(ios::fixed, ios::floatfield);
  cout.precision(8);
  ios_base::sync_with_stdio(false);
  long long n, l, k;
  cin >> n >> l >> k;
  vector<int> _a(n), a(n);
  for (int i = 0; i < (int)(n); i++) {
    cin >> a[i];
    _a[i] = a[i];
  }
  sort(((_a).begin()), ((_a).end()));
  _a.erase(unique(((_a).begin()), ((_a).end())), _a.end());
  for (int i = 0; i < (int)(n); i++)
    a[i] = lower_bound(((_a).begin()), ((_a).end()), a[i]) - _a.begin();
  const long long BLOCK = l / n;
  vector<vector<long long> > dp(2, vector<long long>(n, 1));
  long long res = 0;
  vector<long long> &cur = dp[0];
  vector<long long> &next = dp[1];
  for (int width = 1; width < (int)(k + 1); width++) {
    fill(((next).begin()), ((next).end()), 0);
    for (int i = 0; i < (int)(n); i++) {
      next[a[i]] += cur[a[i]];
      next[a[i]] %= MOD;
      int add = (int)(i < l % n);
      long long length = BLOCK + add;
      if (length >= width) {
        res += (cur[a[i]] * ((length + 1 - width) % MOD)) % MOD;
        res %= MOD;
      }
    }
    for (int i = 1; i < (int)(n); i++) {
      next[i] += next[i - 1];
      next[i] %= MOD;
    }
    swap(cur, next);
  }
  cout << res << endl;
  return 0;
}
