#include <bits/stdc++.h>
#define MAX 100001
using namespace std;
ifstream fin("distincte.in");
ofstream fout("distincte.out");
int n,m,k,i,j,v[MAX],st,dr,fr[MAX+1];
long long aib[MAX+1],sol[MAX+1];
struct elem{
    int st,dr,id;
}q[MAX+1];
bool cmp(elem a, elem b){
    return a.dr < b.dr;
}
void update(int p, int val){
    for(;p<=n;p+=(p&-p)){
        aib[p] += val;
    }
}
long long query(int p){
    long long sum=0;
    for(;p>0;p-=(p&-p)){
        sum += aib[p];
    }
    return sum;
}
int main()
{
    fin>>n>>k>>m;
    for(i=1;i<=n;i++){
        fin>>v[i];
    }
    for(i=1;i<=m;i++){
        fin>>q[i].st>>q[i].dr;
        q[i].id = i;
    }
    sort(q+1,q+m+1,cmp);
    j=1;
    for(i=1;i<=n;i++){
        if(fr[v[i]]){
            update(fr[v[i]],-v[i]);
        }
        fr[v[i]] = i;
        update(fr[v[i]],v[i]);
        while(j<=m && q[j].dr == i){
            sol[q[j].id] = query(q[j].dr)-query(q[j].st-1);
            j++;
        }
    }
    for(i=1;i<=m;i++){
        fout<<sol[i]<<'\n';
    }
    return 0;
}