#include <bits/stdc++.h>
using namespace std;
#define int long long
bool valid(map<int,int> &req, map<int,int> ¤t) {
if(current.size() < req.size()) return false;
for(auto &[key, value] : req) {
if(current[key] < value) return false;
}
return true;
}
signed main() {
int N, K, R;
cin >> N >> K >> R;
vector<int> dna(N);
for(int i = 0; i < N; i++) {
cin >> dna[i];
}
map<int, int> req;
for(int i = 0; i < R; i++) {
int a, b;
cin >> a >> b;
req[a] = b;
}
int ans = LLONG_MAX;
//sliding window
map<int,int> current;
int l(0), r(0); //no elements selected
while(r <= N) {
if(!valid(req, current)) { //not valid
// cout << "invalid: " << l << " " << r << "\n";
current[dna[r]] += 1;
r++;
}
else { //valid
// cout << "valid: " << l << " " << r << "\n";
ans = min(ans, r-l);
current[dna[l]] -= 1;
l++;
}
}
if(ans == LLONG_MAX) {
cout << "impossible\n";
} else {
cout << ans << "\n";
}
return 0;
}
