/*
Normie's Template v2.2
Changes:
Added modulo binpow and inverse.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
//Pragmas (Comment out these three lines if you're submitting in szkopul.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define nfio cin.tie(0);cout.tie(0)
#define endl "\n"
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
a=(a<b)?a:b;
}
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
a=(a>b)?a:b;
}
//Constants.
#define MOD (ll(1000000007))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
if (!x) return 1;
ll res=BOW(a,x/2,p);
res*=res;
res%=p;
if (x%2) res*=a;
return res%p;
}
ll INV(ll a, ll p)
{
return BOW(a,p-2,p);
}
//---------END-------//
#include "peru.h"
vector<int> vec;
ll m,i,j,t,t1,a,b,c,d,e;
ll dp[400001];
int arr[400001];
struct seg
{
ll val[1600001];
void reset(ll c, ll l, ll r)
{
val[c]=1e18;
int mid=(l+r)/2;
if (l<r)
{
reset((c<<1),l,mid);
reset((c<<1)+1,mid+1,r);
}
}
void upd(ll c, ll l, ll r, ll t, ll x)
{
if ((l<=t)and(t<=r))
{
if (l==r)
val[c]=x;
else
{
ll mid=(l+r)/2;
upd((c<<1),l,mid,t,x);
upd((c<<1)+1,mid+1,r,t,x);
val[c]=min(val[(c<<1)],val[(c<<1)+1]);
}
}
}
ll get(ll c, ll l, ll r, ll tl, ll tr)
{
if ((tl>r)or(tr<l))
return 1e18;
if ((tl<=l)and(tr>=r)) return val[c];
else
{
int mid=(l+r)/2;
ll a=get((c<<1),l,mid,tl,tr);
ll b=get((c<<1)+1,mid+1,r,tl,tr);
return min(a,b);
}
}
};
seg st;
int solve(int n, int k, int* v){
memcpy(arr+1,v,4*n);
arr[0]=2e9+7;
dp[0]=0;
st.reset(1,1,n);
vec.push_back(0);
for (i=1;i<=n;i++)
{
while(arr[vec[vec.size()-1]]<=arr[i])
{
st.upd(1,1,n,vec[vec.size()-1],1e18);
vec.pop_back();
}
vec.push_back(i);
st.upd(1,1,n,i,arr[i]+dp[vec[vec.size()-2]]);
a=1e18;
b=lower_bound(vec.begin(),vec.end(),max(1,i-k+1))-vec.begin();
if (b<vec.size()-1)
{
c=st.get(1,1,n,vec[b+1],i);
a=min(a,c);
}
// for (auto g : vec) cout<<g<<' ';
// cout<<b<<' ';
a=min(a,arr[vec[b]]+dp[max(0,i-k)]);
e*=23;
e+=a;
// cout<<a;
dp[i]=a;
// cout<<endl;
e%=MOD;
}
//cout<<endl;
return e;
}
