#include <bits/stdc++.h>   using namespace std;   int n, k, a[1000005];   long long l;   vector<int> val, cou, dp[1000005];   void add(int &a, int b) {     a += b;     if (a >= 1000000007) a -= 1000000007;   }   void setup() {     cin >> n >> l >> k;     for (int i = 0; i <= n - 1; i++) {       cin >> a[i];       val.push_back(a[i]);     }     sort(val.begin(), val.end());     val.resize(unique(val.begin(), val.end()) - val.begin());     cou.resize(val.size());     for (int i = 0; i <= n - 1; i++) {       dp[i].resize(k + 1);       dp[i][1] = 1;       a[i] = lower_bound(val.begin(), val.end(), a[i]) - val.begin();     }   }   void xuly() {     for (int j = 2; j <= k; j++) {       for (int i = 0; i <= int(cou.size()) - 1; i++) cou[i] = 0;       for (int i = 0; i <= n - 1; i++) add(cou[a[i]], dp[i][j - 1]);       for (int i = 1; i <= int(cou.size()) - 1; i++) add(cou[i], cou[i - 1]);       for (int i = 0; i <= n - 1; i++) dp[i][j] = cou[a[i]];     }     int ans = 0;     for (int i = 0; i <= n - 1; i++)       for (int j = 1; j <= k; j++) {         long long m = l / n;         if (i < l % n) m++;         m = m - j + 1;         if (m > 0) ans = (ans + (m % 1000000007) * dp[i][j]) % 1000000007;       }     cout << ans;   }   int main() {     ios_base::sync_with_stdio(0);     cin.tie(NULL);     cout.tie(NULL);     setup();     xuly();     return 0;   }   