#include <bits/stdc++.h>
using namespace std;
typedef long long i64;

const int NMAX = 100005;

struct QUERY {
    int st, dr, ant, index;
};

int n, k, m;

int        nxt[NMAX],
           lst[NMAX];
i64        aib[NMAX],
             v[NMAX];
QUERY        q[NMAX];

bool cmp_a(const QUERY &a, const QUERY &b) {
    return a.st < b.dr;
}

bool cmp_b(const QUERY &a, const QUERY &b) {
    return a.index < b.index;
}

inline int lsb(int arg) {
    return arg&-arg;
}

inline i64 aib_query(int pos) {
    i64 ant = 0;
    while(pos > 0) {
        ant+= aib[pos];
        pos-= lsb(pos);
    }
    return ant;
}

inline void aib_update(int pos, i64 val) {
    while(pos < NMAX) {
        aib[pos]+= val;
        pos+= lsb(pos);
    }
}

int main(void) {
    ifstream fi("distincte.in");
    ofstream fo("distincte.out");
    int st;

    fi >> n >> k >> m;
    for(int i=1; i<=n; ++i)
        fi >> v[i];

    for(int i=1; i<=m; ++i) {
        fi >> q[i].st >> q[i].dr; //csf...
        q[i].index = i;
    }

    for(int i=1; i<=n; ++i) {
        nxt[lst[v[i]]] = i;
        if(!lst[v[i]])
            aib_update(i, v[i]);
        lst[v[i]] = i;
    }

    sort(q+1, q+1+m, cmp_a);

    st = 1;
    for(int i=1; i<=m; ++i) {
        for(; st<q[i].st; ++st) {
            aib_update(st, -v[st]);
            if(nxt[i])
                aib_update(nxt[i], v[st]);
        }
        q[i].ant = aib_query(q[i].dr);
    }

    sort(q+1, q+1+m, cmp_b);

    for(int i=1; i<=m; ++i)
        fo << q[i].ant << '\n';

    return 0;
}