#include<bits/stdc++.h>
using namespace std;

int n,m;
vector<int> mapa[100010];
int degree[100010];
queue<int> cango;
vector<int> ans;
bool check(){
	for (int i=1;i<=n;i++){
		if (degree[i]){
			return 0;
		}
	}
	return 1;
}
int main(){
	cin>>n>>m;
	int a,b;
	for (int i=0;i<m;i++){
		cin>>a>>b;
		mapa[a].push_back(b);
		degree[b]++;
	}
	for (int i=1;i<=n;i++){
		if (!degree[i]){
			cango.push(i);
		}
	}
	int from;
	while (cango.size()){
		from=cango.front();cango.pop();
		ans.push_back(from);
		for (int x:mapa[from]){
			degree[x]--;
			if (!degree[x]){
				cango.push(x);
			}
		}
	}
	if (check()){
		cout<<"YES\n";
		for (int i=0;i<n;i++){
			cout<<ans[i]<<'\n';
		}
	}else {
		cout<<"NO\n";
	}
	return 0;
}

#include <bits/stdc++.h>
using namespace std;

vector<int> mapa[100010];
int wed[100010];
int cnth;
void DFS(int I){
	int sizea=mapa[I].size();
	wed[I]=1;
	cnth+=sizea%2;
	for (int i=0;i<sizea;i++){
		if (!wed[mapa[I][i]]){
			DFS(mapa[I][i]);
		}
	}
}
int main(){
	int A,B,S,M,K,a,b,w,ans=0;
	cin>>A>>B>>S>>M>>K;
	for (int i=0;i<K;i++){
		cin>>a>>b>>w;
		mapa[a].push_back(A+b);
		mapa[A+b].push_back(a);
	}
	memset(wed,0,sizeof(wed));
	for (int i=1;i<=A+B;i++){
		if (!wed[i]&&mapa[i].size()){
			cnth=0;
			DFS(i);
			if (cnth==0){
				ans++;
			}
			ans+=cnth/2;
		}
	}
	cout<<ans;
	return 0;
}