#include <tuple>
#include <algorithm>
#include <math.h>
#define MN 100001
#pragma GCC optimize("Ofast")
#include <stdio.h>
#include <ctype.h>
//#pragma GCC target("avx2")
using namespace std;

int F[MN], n, k, m, V[MN], R[MN], rez;
tuple<int, int, int> Q[MN];

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;
	}
} fi("distincte.in");

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;
    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }
public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }
    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }
    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }
    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
} fo("distincte.out");
int main() {
    fi >> n >> k >> m;
    for(int i = 1; i <= n; ++i) fi >> V[i];
    for(int i = 1; i <= m; ++i) {
        fi >> get<0>(Q[i]) >> get<1>(Q[i]);
        get<2>(Q[i]) = i;
    }
    int rad = (int)(.5 + sqrt(double(n)));
    sort(Q+1, Q+m+1, [&](auto a, auto b) {
        if((get<0>(a) / rad) != (get<0>(b) / rad))
            return (get<0>(a) / rad) < (get<0>(b) / rad);
        return bool((get<1>(a) < get<1>(b)) ^ (((get<0>(a) / rad) & 1)));
    });
    int st = 1, dr = 0;
    for(int i = 1; i <= m; ++i) {
        auto [l, r, id] = Q[i];
        while(dr < r) {
            if(!(F[V[++dr]]++)) {
                rez += V[dr];
                if(rez > 666012) rez -= 666013;
            }
        }
        while(dr > r) {
            if(!(--F[V[dr--]])){
                 rez -= V[dr+1];
                 if(rez < 0) rez += 666013;
            }
        }
        while(st < l) {
            if(!(--F[V[st++]])){
                 rez -= V[st-1];
                 if(rez < 0) rez += 666013;
            }
        }
        while(l < st){
            if(!(F[V[--st]]++)) {
                rez += V[st];
                if(rez > 666012) rez -= 666013;
            }
        }
        R[id] = rez;
    }
    for(int i = 1; i <= m; ++i) fo << R[i] << "\n";
    return 0;
}