#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <queue>
#include <utility>
#include <string>
using namespace std;

#define REP(i, N) for (int i = 0; i < (N); ++i)
#define REPV(i, a, b) for (int i = (a); i <= (b); ++i)
#define REPD(i, N) for (int i = (N)-1; i >= 0; --i)
#define REPVD(i, b, a) for (int i = (b); i >= (a); --i)
#define REPIT(it, v) for (it = (v).begin(); it != (v).end(); ++it)
#define SZ(a) ((int)(a).size())
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define ALL(a) (a).begin(), (a).end()
#define CLR(a) memset((a), 0, sizeof(a))
#define MSET(a, v) memset((a), v, sizeof(a))
#define CPY(dest, source) memcpy(dest, source, sizeof(dest))

typedef long long LL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef set<int> SI;
typedef map<int, int> MII;
typedef deque<int> QI;
typedef deque<PII> QPII;

int A[102400], trn[102400];

int main() {
	freopen("distincte.in", "rt", stdin);
	freopen("distincte.out", "wt", stdout);

	int N, K, M;
	scanf("%d %d %d", &N, &K, &M);

	REP(i, N) scanf("%d", &A[i]);

	MSET(trn, -1);

	REP(i, M) {
		int a, b;
		scanf("%d %d", &a, &b); a--, b--;
		LL S = 0;
		REPV(j, a, b) {
			if (trn[A[j]] != i) {
				S += A[j];
				trn[A[j]] = i;
			}
		}
		printf("%lld\n", S);
	}

	return 0;
}