#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define aint(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,m,a[100005],bit[100005],last=1,pos[100005],ans[100005],k;
vector<pair<pair<ll,ll>,ll>>v;
void update(ll pos,ll val){
for(;pos<=n;pos+=pos&(-pos)){
    bit[pos]+=val;
}
}
ll query(ll pos){
ll res=0;
for(;pos;pos-=pos&(-pos)){
    res+=bit[pos];
}
return res;
}
ll solve(ll l,ll r){
while(last<=r){
    if(pos[a[last]]==0){
        pos[a[last]]=last;
        update(last,a[last]);
    }else {
    update(pos[a[last]],-a[last]);
    pos[a[last]]=last;
    update(pos[a[last]],a[last]);
    }
    last++;
}
return query(r)-query(l-1);
}
bool cmp(pair<pair<ll,ll>,ll>a,pair<pair<ll,ll>,ll>b){
if(a.s==b.s){
    return a.f<b.f;
}else return a.s<b.s;
}
int32_t main(){
CODE_START;
ifstream cin("distincte.in");
ofstream cout("distincte.out");
cin>>n>>k>>m;
for(ll i=1;i<=n;i++)
{
    cin>>a[i];
}
for(ll i=1;i<=m;i++)
{
    ll x,y;
    cin>>x>>y;
    v.pb(mp(mp(x,y),i));
}
sort(v.begin(),v.end(),cmp);
for(auto it : v){
    ans[it.s]=solve(it.f.f,it.f.s);
}
for(ll i=1;i<=m;i++){
    cout<<ans[i]%666013<<endl;
}
}