#include<iostream>#include<algorithm>#include<cstring>#include<queue>#include<stack>#include<unordered_set>usingnamespace std;typedeflonglong ll;constint N =15;int n, m, x, y;int k[N], p[N];intmain(){ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);cin >> n >> x >> y;for(int i =1; i <= n; i ++) cin >> k[i];cin >> m;for(int i =1; i <= m; i ++) cin >> p[i];int ans =0, cnt =0;if(x > y){int a = x -1, b = x +1;for(int i =1; i <= m; i ++){if(a >=1&& p[i]== k[a])ans ++, a --;if(b <= n && p[i]== k[b])cnt ++, b ++;}}else{int a = x +1, b = x -1;for(int i =1; i <= m; i ++){if(a <= n && p[i]== k[a])ans ++, a ++;if(b >=1&& p[i]== k[b])cnt ++, b --;}}if(ans == m && cnt == m) cout <<"Unsure"<< endl;elseif(ans == m) cout <<"Right"<< endl;else cout <<"Wrong"<< endl;return0;}