#include <cstdio>
#include <algorithm>
using namespace std;

int n, k, m;
int a[100005], p[100005], y[100005], x[100005], ans[100005], aib[100005];
struct query{
    int i, j, p;
    bool operator < (const query &aux)const{
        if(j != aux.j) return j < aux.j;
        return i < aux.i;
    }
};
query q[100005];
const int MOD = 666013;
inline bool cmp(int i, int j){
    return y[i] < y[j];
}
inline void U(int p, int val){
    for(int i = p; i <= n ; i = i + (i & (-i))){
        aib[i] += val;
        if(aib[i] >= MOD) aib[i] -= MOD;
    }
}
inline int Q(int p){
    int Sol = 0;
    for(int i = p; i >= 1 ; i = i - (i & (-i))){
        Sol = Sol + aib[i];
        if(Sol >= MOD) Sol -= MOD;
    }
    return Sol;
}
int main()
{
    freopen("distincte.in", "r", stdin);
    freopen("distincte.out", "w", stdout);
    scanf("%d%d%d", &n, &k, &m);
    for(int i = 1; i <= n ; ++i)
        scanf("%d", &a[i]), p[a[i]] = n + 1;
    for(int i = n; i >= 1 ; --i){
        x[i] = i;
        y[i] = p[a[i]];
        p[a[i]] = i;
    }
    sort(x + 1, x + n + 1, cmp);
    for(int i = 1; i <= m ; ++i)
        scanf("%d%d", &q[i].i, &q[i].j), q[i].p = i;
    sort(q + 1, q + m + 1);
    int i = n;
    for(int t = m; t >= 1 ; --t){
        while(y[x[i]] > q[t].j) U(x[i], a[x[i]]), --i;
        int Sol = Q(q[t].j) - Q(q[t].i - 1);
        if(Sol < 0) Sol += MOD;
        ans[q[t].p] = Sol;
    }
    for(int i = 1; i <= m ; ++i)
        printf("%d\n", ans[i]);
    return 0;
}