# include <bits/stdc++.h>
# define maxn 100001
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
# define pb push_back
# define mp make_pair
//# define int ll
using namespace std;
const int inf = INT_MAX;
int n,k,m,l,r;
int a[maxn];
int lst[maxn];
vector<pair<int,int>>vec[maxn];
ll ans[maxn];
int nxt[maxn];
ll t[4 * maxn];
void upd(int nod,int l,int r,int pos,int val)
{
if(l == r)
{
t[nod] = val;
return ;
}
int mid = l + r >> 1;
if(pos <= mid)
upd(nod << 1,l,mid,pos,val);
else upd(nod << 1 | 1,mid + 1,r,pos,val);
t[nod] = t[nod << 1] + t[nod << 1 | 1];
}
int qry(int nod,int tl,int tr,int l,int r)
{
if( l > r) return 0;
if(tl == l && tr == r)
{
return t[nod];
}
int mid = tl + tr >> 1;
return qry(nod << 1,tl,mid,l,min(mid,r)) + qry(nod << 1 | 1,mid +1,tr,max(mid + 1,l),r);
}
int32_t main(){_
freopen("distincte.in","r",stdin);
freopen("distincte.out","w",stdout);
cin >> n >> k >> m;
for(int i = 1;i<=n;i++)
{
cin >> a[i];
nxt[lst[a[i]]] = i;
lst[a[i]] = i;
}
for(int i = 1;i<=m;i++)
{
cin >> l >> r;
vec[l].pb(mp(r,i));
}
for(int i = n;i>=1;i--)
{
upd(1,1,n,i,a[i]);
if(nxt[i])
upd(1,1,n,nxt[i],0);
for(auto it : vec[i])
ans[it.second] = qry(1,1,n,i,it.first);
}
for(int i = 1;i<=m;i++) cout << ans[i] % 666013 << '\n';
}