#include <bits/stdc++.h>

using namespace std;

class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if(sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while(!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if(c == '-') {
            n = 0;
            sgn = -1;
        }
        else
            n = c - '0';
        while(isdigit(c = read_ch()))
            n = 10 * n + c - '0';
        n *= sgn;
        return *this;
    }
};

InParser fin("distincte.in");
ofstream fout("distincte.out");

const int NMAX = 1e5 + 1;

class qry {
    public:
        int x, y, index, block_index;

        bool operator < (const qry &A) const {
            if(block_index != A.block_index)
                return make_pair(x, y) < make_pair(A.x, A.y);
            return (block_index & 1) ? (y < A.y) : (y > A.y);
        }
} q[NMAX];

const int mod = 666013;
int a[NMAX], fr[NMAX];
long long sol[NMAX], sum;

void update(int x, int add) {
    fr[x] += add;
    if(fr[x] == 1 && add == 1)
        sum += x;
    else
        if(fr[x] == 0)
            sum -= x;
}

int main() {
    int N, K, Q;
    fin >> N >> K >> Q;
    for(int i = 1; i <= N; ++i)
        fin >> a[i];
    const int block = sqrt(N);
    for(int i = 0; i < Q; ++i) {
        fin >> q[i].x >> q[i].y;
        q[i].index = i;
        q[i].block_index = q[i].x / block;
    }
    sort(q, q + Q);
    int st = q[0].x, dr = q[0].y;
    for(int i = st; i <= dr; ++i)
        update(a[i], 1);
    sol[q[0].index] = sum;
    for(int i = 1; i < Q; ++i) {
        while(st > q[i].x)
            update(a[--st], 1);
        while(dr < q[i].y)
            update(a[++dr], 1);
        while(st < q[i].x)
            update(a[st++], -1);
        while(dr > q[i].y)
            update(a[dr--], -1);
        sol[q[i].index] = sum;
    }
    for(int i = 0; i < Q; ++i)
        fout << sol[i] % mod << '\n';
}