#include "bits/stdc++.h" using namespace std; #ifdef _DEBUG #include "dump.hpp" #else #define dump(...) #endif //#define int long long #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--) #define all(c) begin(c),end(c) const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f; const int MOD = 1'000'000'007; template bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; } // 順列(zero-based)のソートでの最小交換回数 int minimumNumbersOfSwaps(const vector &v) { int n = v.size(); vector vis(n); int ret = 0; for (int i = 0; i < n; i++) { if (vis[i])continue; int p = i; int size = 0; while (!vis[p]) { vis[p] = true; size++; p = v[i]; } ret += size - 1; } return ret; } signed main() { cin.tie(0); ios::sync_with_stdio(false); long long N, K; cin >> N >> K; vector D(N); rep(i, 0, N) { cin >> D[i]; D[i]--; } int r = minimumNumbersOfSwaps(D); if(K >= r && K % 2 == r % 2) cout << "YES" << endl; else cout << "NO" << endl; return 0; }