#include <bits/stdc++.h>
//#define int long long
#define fi first
#define se second 
#define pb push_back
#define ott(i, l, r) for (register int i = (l); i <= (r); i ++)
#define tto(i, l, r) for (register int i = (r); i >= (l); i --)
using namespace std;
typedef long long ll;
typedef long double ld;
int read () {
	int x = 0; bool f = false; char c = getchar ();
	while (!isdigit (c)) f |= (c == '-'), c = getchar ();
	while (isdigit (c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar ();
	return f ? -x : x;
}
const int N = 2e5 + 110, mod = 1e9 + 7;
int n, m; bool fl;
int a[N << 1], b[N];
int main () {
	n = read (), m = read (); ott (i, 1, n) a[i + n] = a[i] = read (); ott (i, 1, m) b[i] = read ();
	ott (i, 1, n + n - m + 1) {
		if (a[i] == b[1]) {
			bool ok = true;
			ott (j, 1, m) ok &= b[j] == a[i + j - 1];
			fl |= ok;
		}
	}
	reverse (a + 1, a + 1 + n + n);
	ott (i, 1, n + n - m + 1) {
		if (a[i] == b[1]) {
			bool ok = true;
			ott (j, 1, m) ok &= b[j] == a[i + j - 1];
			fl |= ok;
		}
	}
	printf ("%d\n", fl);
    return 0;
}