#include <bits/stdc++.h>
using namespace std;
const double PI = 3.141592653589793238;
bool DBG = false;
template <typename T, typename S>
std::ostream& operator<<(std::ostream& os, const std::pair<T, S>& p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template <typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& vector) {
  for (size_t i = 0; i < vector.size(); ++i) {
    os << vector[i] << " ";
  }
  return os;
}
template <typename T>
std::ostream& operator<<(std::ostream& os,
                         const std::vector<std::vector<T>>& vv) {
  for (size_t i = 0; i < vv.size(); ++i) {
    os << vv[i] << std::endl;
  }
  return os;
}
const int MOD = 1000000007;
int main() {
  std::ios_base::sync_with_stdio(false);
  int n, k;
  long long l;
  cin >> n >> l >> k;
  vector<pair<int, int>> a(n);
  for (int i = 0; i < (int)(n); ++i) {
    cin >> a[i].first;
    a[i].second = i;
  }
  if (DBG) {
    cout << "a init: \n" << a << endl;
  }
  sort(a.begin(), a.end(),
       [](const pair<int, int>& x, const pair<int, int>& y) -> bool {
         return x.first < y.first;
       });
  if (DBG) {
    cout << "a sort: \n" << a << endl;
  }
  vector<vector<int>> d(k + 1, vector<int>(n, 0));
  for (int i = 0; i < (int)(n); ++i) {
    d[1][i] = 1;
  }
  for (int len = 2; len <= k; ++len) {
    int pos = 0, sum = 0;
    for (int i = 0; i < (int)(n); ++i) {
      while (pos < n && a[pos].first <= a[i].first) {
        sum = (sum + d[len - 1][a[pos].second]) % MOD;
        ++pos;
      }
      d[len][a[i].second] = sum;
    }
  }
  long long full_blocks = l / n;
  int last_block_len = l % n;
  int res = 0;
  for (int len = 1; len <= k; ++len) {
    for (int i = 0; i < (int)(n); ++i) {
      int blocks_cnt = (full_blocks - len + 1) % MOD;
      if (a[i].second < last_block_len) {
        blocks_cnt++;
      }
      blocks_cnt = max(blocks_cnt, 0);
      long long add = 1ll * d[len][a[i].second] * blocks_cnt;
      res = (res + add % MOD) % MOD;
    }
  }
  cout << res << endl;
  return 0;
}
