#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++) #define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++) #define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--) #define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--) #define DEBUG(C) cerr << #C << " = " << C << endl; using LL = long long; using VI = vector; using VVI = vector; using VL = vector; using VVL = vector; using VD = vector; using VVD = vector; using PII = pair; using PDD = pair; using PLL = pair; using VPII = vector; template using VT = vector; #define ALL(a) begin((a)), end((a)) #define RALL(a) rbegin((a)), rend((a)) #define SORT(a) sort(ALL((a))) #define RSORT(a) sort(RALL((a))) #define REVERSE(a) reverse(ALL((a))) #define MP make_pair #define FORE(a, b) for (auto &&a : (b)) #define FIND(s, e) ((s).find(e) != (s).end()) #define EB emplace_back template inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;} template inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;} const int INF = 1e9; const int MOD = INF + 7; const LL LLINF = 1e18; const int MAX = 200010; LL N, K; LL D[MAX], DD[MAX]; int main(void) { scanf("%lld%lld", &N, &K); REP(i, N) { scanf("%lld", D + i); D[i]--; DD[D[i]] = i; } LL dame = 0; REP(i, N) { if (D[i] != i) { dame++; DD[D[i]] = DD[i]; swap(D[i], D[DD[i]]); } } //DEBUG(dame) //REP(i, N) DEBUG(D[i]) if (K < dame) { cout << "NO" << endl; } else if (K == dame) { cout << "YES" << endl; } else { if ((K - dame) % 2) { cout << "NO" << endl; } else { cout << "YES" << endl; } } }