#include #include #include #include #include #include #include #include #include #include #include using namespace std; long long int n,m,k,s,t,u,v; bool e[2001][2001]; bool dp[2001][2001][2][2]; int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> n >> m >> k >> s >> t; for(int i=0;i> u >> v; e[u][v] = true; e[v][u] = true; } dp[s][0][0][0] = true; queue ,pair>> que; que.push(make_pair(make_pair(s,0),make_pair(0,0))); while(!que.empty()) { int now = que.front().first.first; int d = que.front().first.second; int p = que.front().second.first; int f = que.front().second.second; que.pop(); for(int next=1;next<=n;next++) { if(next==now) continue; if(e[now][next]) { if(d+1 <= n && dp[next][d+1][(1-p)][f]==false) { dp[next][d+1][(1-p)][f] = true; que.push(make_pair(make_pair(next,d+1),make_pair(1-p,f))); } } else { if(f==0) { if(d+1 <= n && dp[next][d+1][(1-p)][1-f]==false) { dp[next][d+1][(1-p)][1-f] = dp[now][d+1][p][f] + 1; que.push(make_pair(make_pair(next,d+1),make_pair(1-p,1-f))); } } } } } long long int res = 2e18; for(int i=0;i<=n;i++) { bool ok = false; for(int j=0;j<2;j++) { for(int k=0;k<2;k++) { if(dp[t][i][j][k]) { ok = true; } } } if(ok) { long long int d = k - i; if(d%2==0) { cout << "Yes" << '\n'; return 0; } } } cout << "No" << '\n'; return 0; }