#include <cstdio>
#include <algorithm>
#define ub(x) (x&(-x))
#define f first
#define MOD 666013
#define s second
#define NMAX 100010
using namespace std;
int A[NMAX],a[NMAX],i,j,n,m,k,ok[NMAX],sol[NMAX];
pair <pair <int,int>,int> op[NMAX];
inline void updt(int poz,int val)
{
    int i;
    for (i=poz; i<=n; i+=ub(i))
        A[i]=(A[i]+val+MOD)%MOD;
    return ;

}
inline int calc(int poz)
{
    int s=0;
    for (int i=poz; i>0; i-=ub(i))
        s=(s+A[i]+MOD)%MOD;
    return s;
}
int main()
{
    freopen("distincte.in","r",stdin);
    freopen("distincte.out","w",stdout);
    scanf("%d %d %d\n",&n,&k,&m);
    for (i=1; i<=n; i++)
        scanf("%d\n",&a[i]);
    for (i=1; i<=m; i++)
    {
        scanf("%d %d\n",&op[i].f.s,&op[i].f.f);
        op[i].s=i;
    }
    j=1;
    sort(op+1,op+m+1);
    for (i=1; i<=m; i++)
    {
        for (; j<=op[i].f.f; j++)
        {
            if (ok[a[j]]!=0)updt(ok[a[j]],-a[j]);
            updt(j,a[j]);
            ok[a[j]]=j;
        }
        sol[op[i].s]=(calc(op[i].f.f)-calc(op[i].f.s-1)+MOD)%MOD;
    }
    //sort(sol+1,sol+m+1);
    for (i=1; i<=m; i++)
        printf("%d\n",sol[i]);
    return 0;
}