#include<bits/stdc++.h> using namespace std; int hea[620001],tot,d[600021],v[620001]; int n,m,s,t,L; priority_queue< pair<int,int> > q; struct Edge{ int next,to,dis; }edge[620001]; //vector<int>vec[] void add(int x,int y,int z) { edge[++tot].next=hea[x]; edge[tot].to=y; edge[tot].dis=z; hea[x]=tot; } int main() { puts("NO"),exit(0); return 0; }