#include <bits/stdc++.h>
#define int long long
using namespace std;   
const int nmax = 1e5;
int n, k, m;
vector<int> v; 
vector<int> last;
struct qr
{
    int st, dr, idx;
    friend bool operator < (const qr &a, const qr &b)
    {
        if(a.dr != b.dr)
            return a.dr < b.dr;
        return a.st < b.st;
    }
};
vector<qr> q;
int aib[nmax + 5];
void update(int pos, int val)
{
    for(; pos <= n; pos += (pos & (-pos)))
        aib[pos] += val;
}
int query(int pos)
{
    int ans = 0;
    for(; pos; pos -= (pos & (-pos)))
        ans += aib[pos];
    return ans;
}
int32_t main()
{
    cin >> n >> k >> m;
    v.resize(n + 5);
    last.resize(k + 5);
    for(int i = 1; i <= n; i ++)
        cin >> v[i];

    q.resize(m + 5);
    for(int i = 1; i <= m; i ++)
    {
          cin >> q[i].st >> q[i].dr;
          q[i].idx = i;
    }
    
    sort(q.begin() + 1, q.begin() + m + 1);

    vector<int> ans(m + 5);

    int ind = 1;
    for(int i = 1; i <= n; i ++)
    {
        if(!last[v[i]])
        {
            last[v[i]] = i;
        }
        else
        {
            update(last[v[i]], -v[i]);
            last[v[i]] = i;
        }

        update(i, v[i]);
        
        while(ind <= m && q[ind].dr == i)
        {
            ans[q[ind].idx] = query(q[ind].dr) - query(q[ind].st - 1);
            ind ++;
        }
    }
    for(int i = 1; i <= m; i ++)
        cout << ans[i] << '\n';
}