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
// Patryk Jędrzejczak

#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for(int i = 0; i < n; ++i)
#define REPR(i, n) for(int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define FORR(i, a, b) for(int i = b - 1; i >= a; --i)
#define EB emplace_back
#define MP make_pair
#define ST first
#define ND second
#define S size
#define RS resize
#define endl '\n'
#define L long long

template<class T> using V = vector<T>;

V<L> pref;

L sum(int l, int r) {
  L result = pref[r];
  if (l > 0) {
    result -= pref[l - 1];
  }
  return result;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int n, k, q;
  cin >> n >> k >> q;

  V<L> a(n);
  REP(i, n) {
    cin >> a[i];
  }

  pref.RS(n);
  pref[0] = a[0];
  FOR(i, 1, n) {
    pref[i] = pref[i - 1] + a[i];
  }

  REP(f, q) {
    int l, r;
    cin >> l >> r;
    l--, r--;

    int c = r - l + 1;
    V<L> dp(c); 
    REP(i, c) {
      if (i > 0) {
        dp[i] = dp[i - 1];
      }
      if (i >= k - 1) {
        dp[i] = max(dp[i], (i - k >= 0 ? dp[i - k] : 0) + sum(i - k + 1 + l, i + l));
      }
    }

    cout << dp[c - 1] << '\n';
  }
}