#include <fstream>
#include <algorithm>
#include <cmath>

using namespace std;

const int MAX_N = 1e5;
const int MOD = 666013;
int a[MAX_N + 1], fr[MAX_N + 1];
int n, k, m, bs;

struct query {
    int l;
    int r;
    int ind;
};

bool operator < (const query &a, const query &b) {
    return a.l / bs < b.l / bs || (a.l / bs == b.l / bs && a.r < b.r);
}

query queries[MAX_N + 1];
int answer[MAX_N + 1], index[MAX_N + 1];
int sum = 0;

void expand(int index) {
    if (fr[a[index]] == 0) {
        sum = (sum + a[index]) % MOD;
    }
    fr[a[index]]++;
}

void contract(int index) {
    fr[a[index]]--;
    if (fr[a[index]] == 0) {
        sum = (sum - a[index] % MOD + MOD) % MOD;
    }
}

void Mo() {
    int l = 1, r = 0;
    for (int i = 1; i <= m; i++) {
        int ql = queries[i].l;
        int qr = queries[i].r;
        while (l < ql) {
            contract(l);
            l++;
        }
        while (r > qr) {
            contract(r);
            r--;
        }
        while (l > ql) {
            l--;
            expand(l);
        }
        while (r < qr) {
            r++;
            expand(r);
        }
        answer[i] = sum;
    }
}

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};

int main() {
    InParser fin("distincte.in");
    ofstream fout("distincte.out");
    fin >> n >> k >> m;
    bs = n / sqrt(m);
    if (bs == 0) {
        bs++;
    }
    for (int i = 1; i <= n; i++) {
        fin >> a[i];
    }
    for (int i = 1; i <= m; i++) {
        fin >> queries[i].l >> queries[i].r;
        queries[i].ind = i;
    }
    sort(queries + 1, queries + m + 1);
    for (int i = 1; i <= m; i++) {
        index[queries[i].ind] = i;
    }
    Mo();
    for (int i = 1; i <= m; i++) {
        fout << answer[index[i]] << "\n";
    }
    return 0;
}