#include <bits/stdc++.h>

using namespace std;

ifstream fin("distincte.in");
ofstream fout("distincte.out");

const int DIM = 1e5 + 17;

long long arb[DIM * 6];
long long sol[DIM];

int v[DIM];
int prv[DIM];

vector <pair <int, int> > q[DIM];

void update(int pos, int l, int r, int x, int val)
{
	if(l == r)
	{
		arb[pos] = 1LL * val;
		return ;
	}
	
	int mid = (l + r) / 2;
	
	if(x <= mid)
		update(pos * 2, l, mid, x, val);
	else
		update(pos * 2 + 1, mid + 1, r, x, val);
	
	arb[pos] = arb[pos * 2] + arb[pos * 2 + 1];
}

long long query(int pos, int l, int r, int x, int y)
{
	if(x <= l && r <= y)
	{
		return arb[pos];
	}
	
	int mid = (l + r) / 2;
	
	long long sum = 0;
	
	if(x <= mid)
		sum += query(pos * 2, l, mid, x, y);
		
	if(y > mid)
		sum += query(pos * 2 + 1, mid + 1, r, x, y);
	
	return sum;
}

main()
{
	int n, m, k;
	fin >> n >> k >> m;
	
	for(int i = 1; i <= n; i++)
		fin >> v[i];
	
	for(int i = 1; i <= m; i++)
	{
		int l, r;
		fin >> l >> r;
		
		q[r].push_back({l, i});
	}
	
	for(int i = 1; i <= n; i++)
	{
		update(1, 1, n, i, v[i]);
		
		if(prv[v[i]] != 0)
		{
			update(1, 1, n, prv[v[i]], 0);
		}
		
		prv[v[i]] = i;
		
		for(auto j : q[i])
			sol[j.second] = query(1, 1, n, j.first, i);
	}
	
	for(int i = 1; i <= m; i++)
		fout << sol[i] << '\n';
}