#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };



int main(){
	int n;
	ll k;
	cin >> n >> k;
	vector<int>D(n+1);


	rep(i, 0, n) {
		cin >> D[i+1];
	}

	int cnt = 0;
	rep(i, 1, n+1) {
		while (i != D[i]) {
			int t = D[i];
			swap(D[i], D[t]);
			cnt++;
		}
		if (cnt > k) { 
			cout << "No" << endl;
			return 0;
		}

	}

	if ((cnt - k) % 2 == 0)cout << "Yes" << endl;
	else cout << "No" << endl;

	return 0;
}