#include <bits/stdc++.h>

using namespace std;

using LL = long long;

const int MAX = 3e5+7;
const int MAXK = 300;
const int H = 1 << 19;
const LL INF = 1e18+7;
int n, k, q;

LL DP[MAX][MAXK];
LL arr[MAX];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> k >> q;

    for (int i = 0; i < n; ++i)
    {
        cin >> arr[i];
    }

    for (int h = 0; h < q; ++h)
    {
        int a, b;
        cin >> a >> b;
        --a;
        --b;

        for (int i = 0; i <= k; ++i)
            DP[a][i] = -INF;
        
        DP[a][0] = 0;

        if (k != 1)
            DP[a][1] = arr[a];
        else
            DP[a][0] = arr[a];

        for (int i = a + 1; i <= b; ++i)
        {
            for (int z = 0; z < min(MAXK, k); ++z)
            {
                int zz = z + 1;

                if (zz >= k)
                    zz -= k;

                DP[i][zz] = DP[i - 1][z] + arr[i];
            }

            DP[i][0] = max(DP[i][0], DP[i - 1][0]);
        }

        cout << DP[b][0] << "\n";
    }

    return 0;
}