#include #define rep(i, n) for (int i = 0; i < (n); ++i) using namespace std; using ll = long long; int main() { int n, m; cin >> n >> m; vector a(n); rep(i, n) cin >> a[i]; vector g(n); rep(i, m) { int u, v; cin >> u >> v; --u; --v; g[u] |= 1< __builtin_popcount(g[i])) { puts("No"); return 0; } } int n2 = 1<>i&1) << " \n"[i == n-1]; return 0; } } puts("No"); return 0; }