#include <stdio.h>
#include <algorithm>
using namespace std;

const int MAX_N = 100000;
const int MOD = 666013;

int n, k, m;
int v[MAX_N + 1], last[MAX_N + 1];
int bit[MAX_N + 1];
struct querys
{
    int l, r, ind, sol;
}q[MAX_N + 1];

int lsb(int x)
{
    return x & (-x);
}

bool cmp(querys a, querys b)
{
    return a.r < b.r;
}

bool cmp2(querys a, querys b)
{
    return a.ind < b.ind;
}

void update(int pos, int val)
{
    if(pos > n)
        return;
    bit[pos] += val;
    pos += lsb(pos);
    update(pos, val);
}

int query(int pos)
{
    long long s = 0;
    while(pos)
    {
        s = (s + bit[pos]) % MOD;
        pos -= lsb(pos);
    }
    return s;
}

int main()
{
    FILE *fin, *fout;

    fin = fopen("distincte.in", "r");
    fout = fopen("distincte.out", "w");

    fscanf(fin, "%d%d%d", &n, &k, &m);

    for(int i = 1; i <= n; i++)
        fscanf(fin, "%d", &v[i]);

    for(int i = 1; i <= m; i++)
    {
        fscanf(fin, "%d%d", &q[i].l, &q[i].r);
        q[i].ind = i;
    }
    sort(q + 1, q + m + 1, cmp);
    int w = 1;

    for(int i = 1; i <= n; i++)
    {
        if(last[v[i]] == 0)
        {
            update(i, v[i]);
            last[v[i]] = i;
        }
        else
        {
            update(last[v[i]], -v[i]);
            update(i, v[i]);
            last[v[i]] = i;
        }
        while(i == q[w].r)
        {
            q[w].sol = (query(q[w].r) - query(q[w].l - 1) + 2 * MOD) % MOD;
            w++;
        }
    }

    sort(q + 1, q + m + 1, cmp2);

    for(int i = 1; i <= m; i++)
        fprintf(fout, "%d\n", q[i].sol);

    return 0;
}