#include<cstdio>
#include<algorithm>
using namespace std;
int mod,i,n,po,K,m,ras[100009],a[100009],ap[100009],aib[100009];
struct QR{int st,dr,p;}b[100009];bool cmp(QR a,QR b){return a.dr>b.dr;};
struct pct{int i,urm;}c[100009];bool cmpp(pct a,pct b){return a.urm>b.urm;};
void U(int p,int v){while(p<=n){aib[p]=(aib[p]+v)%mod;p+=(p-(p&(p-1)));}}
int Q(int p){int s=0;while(p){s=(s+aib[p])%mod;p&=p-1;}return s;}
int main()
{
freopen("distincte.in","r",stdin);
freopen("distincte.out","w",stdout);
scanf("%d",&n);
scanf("%d",&K);
scanf("%d",&m);
mod=666013;
for(i=1;i<=n;i++)
    scanf("%d",&a[i]);
for(i=n;i>=1;i--)
{
    c[i].i=i;
    if(ap[a[i]]==0) c[i].urm=n+1;
    else c[i].urm=ap[a[i]];
    ap[a[i]]=i;
}
sort(c+1,c+n+1,cmpp);
for(i=1;i<=m;i++)
{
    scanf("%d",&b[i].st);
    scanf("%d",&b[i].dr);
    b[i].p=i;
}
sort(b+1,b+m+1,cmp);
for(i=1;i<=n;i++)
    a[i]%=mod;
po=1;
for(i=1;i<=m;i++)
{
    while(c[po].urm>b[i].dr&&po<=n)
    {
        U(c[po].i,a[c[po].i]);
        po++;
    }
    ras[b[i].p]=(Q(b[i].dr)-Q(b[i].st-1))%mod;
    if(ras[b[i].p]<0) ras[b[i].p]+=mod;
}
for(i=1;i<=m;i++)
    printf("%d\n",ras[i]);
return 0;
}