#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) x1*y2-x2*y1 #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2 #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } using val = ll; using func = ll; val op(val a, val b) { return max(a, b); } val e() { return -1e18; } //val mp(func f, val a) { // return MP(a.first + f, a.second); //} //func comp(func f, func g) { // return f + g; //} //func id() { return 0; } ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; ll si[4] = { 0,3,3,0 }; ll sj[4] = { 0,0,3,3 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; vector g; ll n, k; vector vis; tuple, vector> dfs(ll now, ll c, ll root) { ll child = 1; vis[now] = true; vector res0 = { true,false }; vector res1 = { false,true }; bool loop = false; for (auto& [v, a] : g[now]) { if (v == root) { loop = true; continue; } auto [ch, r0, r1] = dfs(v, c, root); child += ch; ll siz = max(res0.size(), res1.size()) + max(r0.size(), r1.size()); vector nres0(siz); vector nres1(siz); REP(i, res0.size()) { REP(j, r0.size()) { nres0[i + j + a] = nres0[i + j + a] || (res0[i] && r0[j]); } } REP(i, res0.size()) { REP(j, r1.size()) { nres0[i + j + 1 - a] = nres0[i + j + 1 - a] || (res0[i] && r1[j]); } } REP(i, res1.size()) { REP(j, r0.size()) { nres1[i + j + 1 - a] = nres1[i + j + 1 - a] || (res1[i] && r0[j]); } } REP(i, res1.size()) { REP(j, r1.size()) { nres1[i + j + a] = nres1[i + j + a] || (res1[i] && r1[j]); } } res0 = nres0; res1 = nres1; } if (loop) { if (c) { REP(i, res0.size()) { res0[i] = false; } } else { REP(i, res1.size()) { res1[i] = false; } } } return make_tuple(child, res0, res1); } ll getroot(VL& p, ll v) { unordered_set s; s.insert(v); while (1) { v = p[v]; if (s.find(v) != s.end()) return v; s.insert(v); } return -1; } void solve() { cin >> n >> k; VL p = read(n); VL a = read(n); vis.resize(n); g.resize(n); DEC(p); REP(i, n) g[p[i]].emplace_back(i, a[i]); vector ans = { true }; REP(i, n) { if (vis[i])continue; ll v = getroot(p, i); auto [cc0, r00, r01] = dfs(v, 0, v); auto [cc1, r10, r11] = dfs(v, 1, v); vector res; if (a[v]) { res = r01; res.push_back(false); REP(i, r10.size()) { res[i] = r10[i] || res[i]; } REP(i, r00.size()) { res[i + 1] = r00[i] || res[i + 1]; } REP(i, r11.size()) { res[i + 1] = r11[i] || res[i + 1]; } } else { res = r00; res.push_back(false); REP(i, r11.size()) { res[i] = r11[i] || res[i]; } REP(i, r01.size()) { res[i + 1] = r01[i] || res[i + 1]; } REP(i, r10.size()) { res[i + 1] = r10[i] || res[i + 1]; } } vector nans(ans.size() + res.size() - 1); REP(i, ans.size()) { REP(j, res.size()) { nans[i + j] = nans[i + j] || (ans[i] && res[j]); } } ans = nans; } if (ans[k]) { cout << "Yes"; } else { cout << "No"; } return; } int main() { ll t = 1; //cin >> t; while (t--) { solve(); } return 0; }