1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include<bits/stdc++.h>
#define VAR(i,n) __typeof(n) i = (n)
#define loop(i,j,s) for(int i=j;i<s;i++)
#define loopback(i,j,s) for(int i=j;i>=s;i--)
#define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++)
#define pln( x ) cout << x << "\n"
#define ps( x ) cout << x << " "
#define entr cout << "\n"
#define pcnt(i) __builtin_popcount(i)
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define SIZE(c) (c).size()
#define ALL(c) (c).begin(), (c).end()
using namespace std;
typedef vector<ll> vi;
typedef pair<int, int> PII;
typedef vector<vector<int> > vvi;
const int INFTY=20000000;
const int MAX=500100;
const int MOD=10000000;

void coutTab(int* tab,int n){
	loop(i,0,n){
		cout<<tab[i]<<" ";
	}
	cout<<"\n";
}

template<class T> void coutVec(vector<T> tab){
	for(T t : tab){
		cout<<t<<" ";
	}
	cout<<"\n";
}
//------------------------------------------
int n,k;
vi a;
vi pref;

ll read_pref(int i, int j) {
    if(i==0) return pref[j];
    return pref[j] - pref[i-1];
}

ll ans(int l, int r) {
    vi dp(r-l+1, 0);
    if(r-l + 1 < k) return 0;
    dp[k-1] = max(0LL,read_pref(l, l+k-1));
    loop(i,k,r-l+1) {
        dp[i] = max(dp[i-1], dp[i-k] + read_pref(l + i-k+1, l+i));
    }
    return dp[r-l];
}

int main(){
	ios_base::sync_with_stdio(0);
    int q;
    cin>>n>>k>>q;
    a = vi(n);
    pref = vi(n);
    loop(i,0,n) cin>>a[i];
    pref[0] = a[0];
    loop(i,1,n) {
        pref[i] = pref[i-1] + a[i];
    }
    int l, r;
    while(q--) {
        cin>>l>>r;
        pln(ans(l-1, r-1));
    }
}