啊啊啊啊啊啊啊，找不出错啊！！

#include <bits/stdc++.h>
using namespace std;

#define int long long

#define N 1010

int n, m;
int a[N], b[N];
int c[N];
signed main()
{
    ios::sync_with_stdio(0);
    cin >> n >> m;
    for(int i = 1;i <= n;i++) {
    	cin >> a[i];
    	c[i] = a[i];
	} 
	for(int i = 1;i <= m;i++) {
    	cin >> b[i];
    	c[n + i] = b[i];
	}
	sort(c + 1, c + n + m + 1);
	for(int i = 1;i < n + m;i++) { 
	    //i<n:要预留i+1 
	    for(int j = 1;j < n;j++) { 
		//j<n:要预留j+1 
		if(c[i] == a[j] && c[i + 1] == a[j + 1]) {
		    //cout << i << " " << j << "\n";
		    cout << "Yes\n";
		    return 0;
		}
		if(c[i] == a[j + 1] && c[i + 1] == a[j]) { 
		    //两个数在a数组中是反的情况 
		    //cout << i << " " << j << "\n";
		    cout << "Yes\n";
		    return 0;
                }
         }
    }
    cout << "No\n";
    return 0;
}