#include <fstream>
using namespace std;
const int N = 100003;
ifstream f("distincte.in");
ofstream g("distincte.out");

int n,k,m;
int v[N];
int main(){

    f>>n>>k>>m;
    for(int i =1; i<= n; i++)
    {
        f>>v[i];
    }

    throw n;

    return 0;
}
/*
const long long SZ = 300003;
const long long MOD = 666013;

inline int mod(int a) {
	return (a + MOD) % MOD;
}

long long where[SZ + 1];
long long first[SZ + 1];
long long last[SZ + 1];

int main(int argc, char** argv) {
	long long M, N, K;
    long long qi, qj;
	long long i, u;
	ifstream f("distincte.in");
	f >> N >> K >> M;
	for (i = 1; i <= N; i++) {
		f >> u;
		last[i] = u;
		if (where[u] == 0) {
			first[i] = u;
		}
		else {
			last[where[u]] = 0;
		}
		where[u] = i;
	}
	for (i = 1; i <= N; i++) {
		first[i] = first[i] + first[i - 1];
		last[i]  = last[i] + last[i - 1];
	}
	ofstream g("distincte.out");
	for (i = 0; i < M; i++) {
		f >> qi >> qj;
		u = first[qj] - last[qi - 1];
		g << mod(u) << "\n";
	}
	f.close();
	g.close();
	return 0;
}
*/