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

int main() {
    int n, d; scanf("%d %d", &n, &d);
    int a[n];
    vector<int> amod[d];
    for(int i = 0; i < n; i++) { 
        scanf("%d", &a[i]);
        amod[i % d].push_back(a[i]);
    }
    int b[n]; 
    vector<int> bmod[d];
    for(int i = 0; i < n; i++) {
        scanf("%d", &b[i]);
        bmod[i % d].push_back(b[i]);
    }
    bool resp = true;
    for(int i = 0; i < d && resp; i++) {
        sort(amod[i].begin(), amod[i].end());
        sort(bmod[i].begin(), bmod[i].end());
        if(amod[i].size() != bmod[i].size()) {
            resp = false;
            break;
        }
        for(int j = 0; j < amod[i].size(); j++) {
            if(amod[i][j] != bmod[i][j]) {
                resp = false;
                break;
            }
        }
    }
    if(resp) printf("S\n");
    else printf("N\n");
}