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
#include <bits/stdc++.h>
using namespace std;
 
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef pair<ll, int> PILL;
typedef pair<ll, ll> PLL;
 
const int MAX_N = 3e5+5;
const int M = 3e4+5;
const ll INF = (ll)(1e18);
const int inf = 1e9;
const ll MOD = 1000000007LL;

int n, k, queries;
ll a[MAX_N], pref[MAX_N];
ll dp[MAX_N];

void calc_ans(int L, int R) {
	for (int i = L-1; i <= R; i++) {
		dp[i] = 0LL;
	}
	
	for (int i = L+k-1; i <= R; i++) {
		dp[i] = max(dp[i], dp[i-1]);
		ll tmp = dp[i-k] + pref[i] - pref[i-k];
		dp[i] = max(dp[i], tmp);
	}
	
	cout << dp[R] << '\n';
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
			
	cin >> n >> k >> queries;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		pref[i] = pref[i-1] + a[i];
	}
	
	for (int qq = 0; qq < queries; qq++) {
		int l, r;
		cin >> l >> r;
		calc_ans(l, r);
	}

	
    return 0;
}