#include #include using namespace std; using isize = size_t; using i32 = int; using u32 = unsigned int; using i64 = long long; using u64 = unsigned long long; using i128 = __int128_t; using u128 = __uint128_t; using f64 = long double; using p2 = pair; using el = tuple; using mint = atcoder::modint998244353; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(18); _main(); } i64 pow(i64 x, i64 n) { i64 res = 1; i64 t = x; while (n > 0) { if (n & 1) res *= t; t *= t; n >>= 1; } return res; } i64 pow(i64 x, i64 n, i64 m) { i64 res = 1; i64 t = x % m; while (n > 0) { if (n & 1) res = res * t % m; t = t * t % m; n >>= 1; } return res; } void _main() { i64 n, m; cin >> n >> m; vector a(n); vector> g(n); for (i64 i = 0; i < n; i++) cin >> a[i]; for (i64 i = 0; i < m; i++) { i64 u, v; cin >> u >> v; u--, v--; g[u].push_back(v); g[v].push_back(u); } for (i64 i = 0; i < 1 << n; i++) { bool ok = true; for (i64 j = 0; j < n; j++) { i64 c = 0; for (i64 nj : g[j]) { c += i >> nj & 1; } ok &= c == a[j]; } if (ok) { cout << "Yes\n"; for (i64 j = 0; j < n; j++) { cout << (i >> j & 1) << (j + 1 == n ? "\n" : " "); } return; } } cout << "No\n"; }