#include int main () { int n = 0; int k = 0; int a[200000] = {}; int b[200000] = {}; int res = 0; int za[600000] = {}; int baa[600000] = {}; int cnta[200001] = {}; int cntb[200001] = {}; int is_ok = 1; res = scanf("%d", &n); res = scanf("%d", &k); for (int i = 0; i < n; i++) { res = scanf("%d", a+i); } for (int i = 0; i < n; i++) { res = scanf("%d", b+i); } if (k >= n) { int is_ok = 1; for (int i = 0; i < n; i++) { if (a[i] != b[i]) { is_ok = 0; } } if (is_ok > 0) { printf("Yes\n"); } else if (k > n) { printf("No\n"); } else { int is_ok = 1; for (int i = 0; i < n; i++) { if (a[i] != b[n-i-1]) { is_ok = 0; } } if (is_ok > 0) { printf("Yes\n"); } else { printf("No\n"); } } return 0; } if (k == n-1) { int i = 1; int j = 0; int is_ok = 0; for (int i = 0; i < n; i++) { baa[i] = b[i]; baa[i+n] = a[i]; baa[i+2*n] = a[i]; } za[0] = 3*n; while (i < 3*n) { while (i+j < 3*n && baa[j] == baa[i+j]) { j++; } za[i] = j; if (j == 0) { i++; } else { int k = 1; while (k < j && k+za[k] < j) { za[i+k] = za[k]; k++; } i += k; j -= k; } } for (int i = n; i < 2*n; i++) { if (za[i] >= n) { is_ok = 1; } } for (int i = 0; i < n; i++) { baa[i] = b[n-i-1]; baa[i+n] = a[i]; baa[i+2*n] = a[i]; } za[0] = 3*n; i = 1; j = 0; while (i < 3*n) { while (i+j < 3*n && baa[j] == baa[i+j]) { j++; } za[i] = j; if (j == 0) { i++; } else { int k = 1; while (k < j && k+za[k] < j) { za[i+k] = za[k]; k++; } i += k; j -= k; } } for (int i = n; i < 2*n; i++) { if (za[i] >= n) { is_ok = 1; } } if (is_ok > 0) { printf("Yes\n"); } else { printf("No\n"); } return 0; } for (int i = 0; i < n; i++) { cnta[a[i]]++; cntb[b[i]]++; } for (int i = 0; i <= 200000; i++) { if (cnta[i] != cntb[i]) { is_ok = 0; } } if (is_ok > 0) { printf("Yes\n"); } else { printf("No\n"); } return 0; }