#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

void solve() {
    int n, d; cin >> n >> d;
    vi a(n), b(n);
    for (int& x : a) {
        cin >> x;
    }
    for (int& x : b) {
        cin >> x;
    }
    vector<vi> u(d), v(d);
    rep(i, 0, n) {
        u[i % d].push_back(a[i]);
        v[i % d].push_back(b[i]);
    }
    rep(i, 0, d) {
        sort(all(u[i]));
        sort(all(v[i]));
        if (u[i] != v[i]) {
            cout << "N\n";
            return;
        }
    }
    cout << "S\n";
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);

    solve();

    return 0;
}