dalao帮帮，90pts, 第七个点WA了...一直找不到错

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;

#define debug(x)std::cout << "Line" << __LINE__ << "	" << #x << "=" << x << std::endl
#define maxn 11000

int ltp = 0, lk[maxn], k, n, m, w, u, v, cnt[maxn], ans;
bool f[maxn], vis[maxn], a[maxn];

struct edg {
	int y, nxt;
} e[maxn];

void ist(int x, int y) {
	e[++ltp] = {y, lk[x]};
	lk[x] = ltp;
}

void bfs(int x) {
	queue<int> q;
	q.push(x);
	f[x] = 1;
	while(!q.empty()) {
		int z = q.front();
		q.pop();
		//printf("%d ", z);
		++cnt[z];
		for(int i = lk[z]; i; i = e[i].nxt) {
			if(!f[e[i].y]) {
				q.push(e[i].y);
				f[e[i].y] = 1;
				++cnt[e[i].y];
			}
		}
	}
}

int main() {
	//freopen("D:\\Chrome Downloadings\\P2853_5.in","r",stdin);
	//freopen("D:\\Chrome Downloadings\\output.txt","w",stdout);
	cin >> k >> n >> m;
	for(int i = 1; i <= k; ++i) {
		scanf("%d", &w);
		a[w] = 1;
	}
	for(int i = 1; i <= m; ++i) {
		scanf("%d %d", &u, &v);
		ist(u, v);
	}
	for(int i = 1; i <= n; ++i) {
		if(a[i]) bfs(i), memset(f, 0, sizeof(f));
	}
	for(int i = 1; i <= n; ++i) {
		//printf("cnt[%d] = %d\n", i, cnt[i]);
		if(cnt[i] >= k) ++ans;
	}
	cout << ans;













	return 0;
}