#include <bits/stdc++.h>
#define ll long long
#include "peru.h"
using namespace std;
const ll nmax = 2500000;
const ll P = 1000000007;
ll dp[nmax];
int solve(int N, int K, int* S) {
for (ll i = 1; i <= N; i++) dp[i] = LLONG_MAX;
for (ll i = 1; i <= N; i++) {
ll maxSoFar = -1;
for (ll j = i - 1; j >= 0 && j >= i - K; j--) {
maxSoFar = max(maxSoFar, 1LL * S[j]);
dp[i] = min(dp[i], (dp[j] + maxSoFar));
}
}
ll put23 = 1;
ll sum = 0;
for (ll i = N; i >= 1; i--) {
sum = (sum + dp[i] * put23 % P) % P;
put23 = ( put23 * 23 ) % P;
}
return sum;
}
/*int s[nmax];
int main() {
int n,k;
in >> n >> k;
for (int i = 0; i < n; i++) in >> s[i];
out << solve(n , k , s);
}
*/
