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
#include <bits/stdc++.h>
#define int long long
#define mp make_pair
#define pb push_back
#define ld long double
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define piii pair<pii,pii>
#define precise cout<<fixed<<setprecision(10)
#define st first
#define nd second
#define ins insert
#define vi vector<int>
#define BOOST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
const int MAX=3e5+5;
int a[MAX];
int pref[MAX];
int maxi[MAX];
 int n,k,q;
 int sum(int l,int r){
	return pref[r]-pref[l-1];
 }
 void solve(int l,int r){
    int ans=0;
    for (int i=l;i<=r;i++){
			maxi[i]=0;
    }
		for (int i=l;i<=r;i++){
			if (i-k+1>=l){
				int suma=sum(i-k+1,i);
				int akt=suma;
				if (i-k+1!=l)akt+=maxi[i-k];
				if (i==k)maxi[i]=max(0LL,akt);
				else maxi[i]=max(maxi[i-1],akt);
				ans=max(ans,akt);
			}
		}
		cout<<ans<<"\n";
 }
int32_t main(){
  BOOST;
  cin>>n>>k>>q;
  for (int i=1;i<=n;i++)cin>>a[i],pref[i]=pref[i-1]+a[i];
  for (int i=1;i<=q;i++){
		int l,r;
		cin>>l>>r;
		solve(l,r);
  }
  
  return 0; 
}