#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,inline")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define fast ios_base::sync_with_stdio(0);f.tie(0);g.tie(0);
#define setinf(x) memset(x,0x3f3f3f3f,sizeof(x));
#define set0(x) memset(x,0,sizeof(x));
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define vi vector<int>
#define ll long long
#define vll vector<ll>
#define pb push_back
#define fi first
#define se second
#define DD 100001
#define nl '\n'
using namespace std;
const string file="distincte";
ifstream f(file+".in");
ofstream g(file+".out");
//#define f cin
//#define g cout
const int mod=666013;
int n,k,m,bs;
ll suma;
int v[DD],r[DD];
int fr[DD];
struct xy {
    int x,y,id;
}q[DD];
bool cmp(xy a, xy b) {
    if (a.x/bs!=b.x/bs) return a.x/bs<b.x/bs;
    return (a.x/bs%2==0)?a.y<b.y:a.y>b.y;
}
void add(int x) {
    if (!fr[v[x]]) (suma+=v[x])%mod;
    fr[v[x]]++;
}
void del(int x) {
   if (fr[v[x]]==1) (suma-=v[x]+mod)%mod;
    fr[v[x]]--;
}
int main() {
    f>>n>>k>>m;
    bs=sqrt(n);
    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].id=i;
    }
    sort(q+1,q+1+m,cmp);
    int most=1,modr=0;
    for (int i=1; i<=m; ++i) {
        int L=q[i].x,R=q[i].y;
        while (modr<R) add(++modr);
        while (modr>R) del(modr--);
        while (most<L) del(most++);
        while (most>L) add(--most);
        r[q[i].id]=suma;
    }
    for (int i=1; i<=m; ++i) {
        g<<r[i]<<nl;
    }
    system("pause");
    return 0;
}