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

int n, k, m;
int a[100005], p[100005], y[100005], x[100005];
long long ans[100005], aib[100005];
vector <pair <int, int> > v[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;
}
inline long long Q(int p){
    long long Sol = 0;
    for(int i = p; i >= 1 ; i = i - (i & (-i)))
        Sol = Sol + aib[i];
    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);
    int st, dr;
    for(int i = 1; i <= m ; ++i){
        scanf("%d%d", &st, &dr);
        v[dr].push_back(make_pair(i, st));
    }
    int i = n;
    for(int t = n; t >= 1 ; --t){
        while(y[x[i]] > t) U(x[i], a[x[i]]), --i;
        for(auto it : v[t]){
            long long Sol = Q(t) - Q(it.second - 1);
            ans[it.first] = Sol;
        }
    }
    for(int i = 1; i <= m ; ++i)
        printf("%d\n", ans[i] % MOD);
    return 0;
}