func_code_string: #include <bits/stdc++.h>   using namespace std;   int A[1000005], B[1000005], cnt[1000005], num[1000005];   long long dp[2][1000005];   int main() {     int n, k;     long long l, ans = 0;     cin >> n >> l >> k;     if (l <= n) {       cout << l << endl;       return 0;     }     for (int i = 0; i < n; i++) scanf( %d , &A[i]);     for (int i = 0; i < n; i++) B[i] = A[i];     sort(B, B + n);     int m = 0, a = 0;     long long S = l / n;     for (int i = 0; i < n; i++) {       a++;       if (B[i] != B[i + 1] || i == n - 1) {         B[m] = B[i];         cnt[m++] = a;         a = 0;       }     }     sort(A, A + l % n);     for (int i = 0; i < m; i++) {       int t = lower_bound(A, A + l % n, B[i]) - A;       num[i] = l % n - t;     }     dp[0][0] = 1;     for (int i = 1; i <= min(S, 1LL * k); i++) {       int cur = i & 1;       long long sum = 0;       for (int j = 0; j < n; j++) {         sum = (sum + dp[!cur][j]) % 1000000007;         dp[cur][j] = (sum * cnt[j]) % 1000000007;         ans = (ans + dp[cur][j] * (S % 1000000007 + 1000000007 - i + 1)) %               1000000007;         if (i < k) ans = (ans + dp[cur][j] * num[j]) % 1000000007;       }     }     ans = (ans + l % n) % 1000000007;     cout << ans << endl;     return 0;   }   