#include <fstream>
#include <algorithm>
#define DIM 100005
#define MOD 666013

using namespace std;

ifstream f("distincte.in");
ofstream g("distincte.out");

int n, m, k, aint[2 * DIM], s, v[DIM], poz[DIM], sol[DIM];

void update(int nod, int st, int dr, int poz, int val){
    if(st == dr && st == poz){
        aint[nod] = val;
        return;
    }
    int mid = (st + dr) / 2;
    if(poz <= mid)
        update(2 * nod, st, mid, poz, val);
    else
        update(2 * nod + 1, mid + 1, dr, poz, val);

    aint[nod] = (aint[2 * nod] + aint[2 * nod + 1]) % MOD;
}

void query(int nod, int st, int dr, int a, int b){
    if(a <= st && b >= dr){
        s += aint[nod];
        s %= MOD;
        return;
    }
    int mid = (st + dr) / 2;
    if(a <= mid)
        query(2 * nod, st, mid, a, b);
    if(b > mid)
        query(2 * nod + 1, mid + 1, dr, a, b);
}

struct quer{
    int x, y, init;
}q[DIM];

bool cmp(quer a, quer b){
    if(a.y == b.y)
        return a.x < b.x;
    return a.y < b.y;
}

int main()
{
    f>>n>>k>>m;
    for(int i = 1; i <= n; ++ i)
        f>>v[i];
    for(int i = 1; i <= m; ++ i){
        f>>q[i].x>>q[i].y;
        q[i].init = i;
    }

    sort(q + 1, q + m + 1, cmp);
    int cnt = 1;

    for(int i = 1; i <= m; ++ i){
        int N = q[i].y;
        for(; cnt <= q[i].y; ++cnt){
            if(!poz[v[cnt]])
                update(1, 1, n, cnt, v[cnt]);
            else{
                update(1, 1, n, poz[v[cnt]], 0);
                update(1, 1, n, cnt, v[cnt]);

            }
            poz[v[cnt]] = cnt;
        }
        s = 0;
        query(1, 1, n, q[i].x, q[i].y);
        sol[q[i].init] = s;
    }

    for(int i = 1; i <= m; ++ i)
        g<<sol[i]<<"\n";

    return 0;
}