#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include <map>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <algorithm>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <string>
using namespace std;

bool rcmp(int a, int b) { return a>b; }
typedef long long LL;
class mypcmp {
public:
    bool operator()(const int& a, const int& b) {
        return a<b;
    }
};



int as[200004];
int bs[200004];
int main() {
    int n, i, k, v, t, s, e;
    scanf("%d %d", &n, &k);
    for (i=0; i<n; i++) scanf("%d", &as[i]);
    for (i=0; i<n; i++) scanf("%d", &bs[i]);
    map<int, int> cs;
    for (i=0; i<n; i++) cs[as[i]]++;
    for (i=0; i<n; i++) {
        v=bs[i];
        if (cs[v]==0) break;
        cs[v]--;
    }
    if(i<n) printf("No\n");
    else {
        for (i=0; i<n; i++) if (as[i]!=bs[i]) break;
        if (i>=n) { printf("Yes\n"); return 0; }
        if (k>n) { printf("No\n"); return 0; }
        for (i=0; i<n; i++) if (as[i]!=bs[n-1-i]) break;
        if (i>=n) { printf("Yes\n"); return 0; }
        if (k==n) { printf("No\n"); return 0; }
        if (k==n-1) {
            if (as[0]==bs[0]) {
                for (i=1; i<n; i++) if (as[i]!=bs[n-i]) break;
                if (i>=n) { printf("Yes\n"); return 0; }
            }
            if (as[n-1]==bs[n-1]) {
                for (i=0; i<n-1; i++) if (as[i]!=bs[n-1-1-i]) break;
                if (i>=n-1) { printf("Yes\n"); return 0; }
            }
            if (as[0]==bs[1]) {
                s=1; e=n-1;
                while(s<e) {
                    t=bs[s]; bs[s]=bs[e]; bs[e]=t;
                    s++; e--;
                }
                for (i=0; i<n; i++) if (as[i]!=bs[n-1-i]) break;
                if (i>=n) { printf("Yes\n"); return 0; }
            } else if (as[n-1]==bs[n-2]) {
                s=0; e=n-2;
                while(s<e) {
                    t=bs[s]; bs[s]=bs[e]; bs[e]=t;
                    s++; e--;
                }
                for (i=0; i<n; i++) if (as[i]!=bs[n-1-i]) break;
                if (i>=n) { printf("Yes\n"); return 0; }
            } else if (as[0]==bs[n-2]) {
                s=0; e=n-2;
                while(s<e) {
                    t=bs[s]; bs[s]=bs[e]; bs[e]=t;
                    s++; e--;
                }
                for (i=0; i<n; i++) if (as[i]!=bs[i]) break;
                if (i>=n) { printf("Yes\n"); return 0; }
                s=1; e=n-1;
                while(s<e) {
                    t=bs[s]; bs[s]=bs[e]; bs[e]=t;
                    s++; e--;
                }
                for (i=0; i<n; i++) if (as[i]!=bs[i]) break;
                if (i>=n) { printf("Yes\n"); return 0; }
            } else if (as[n-1]==bs[1]) {
                s=1; e=n-1;
                while(s<e) {
                    t=bs[s]; bs[s]=bs[e]; bs[e]=t;
                    s++; e--;
                }
                for (i=0; i<n; i++) if (as[i]!=bs[i]) break;
                if (i>=n) { printf("Yes\n"); return 0; }
                s=0; e=n-2;
                while(s<e) {
                    t=bs[s]; bs[s]=bs[e]; bs[e]=t;
                    s++; e--;
                }
                for (i=0; i<n; i++) if (as[i]!=bs[i]) break;
                if (i>=n) { printf("Yes\n"); return 0; }
            }
            printf("No\n");
            return 0;
        }
        printf("Yes\n");
    }
    return 0;
}