#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <codecvt>
#include <locale>
using namespace std;
using ll = long long;

int main() {
    ll N, K;
    cin >> N >> K;
    vector<int> D(N);
    map<int, int> m;
    for(int i=0; i<N; ++i) {
        cin >> D[i];
        D[i]--;
        m[D[i]] = i;
    }
    for(int i=0; i<N && K >= 0; ++i) {
        if(D[i] != i) {
            m[D[i]] = m[i];
            D[m[i]] = D[i];
            D[i] = i;
            m[i] = i;
            K--;
        }
    }
    bool ok = true;
    for(int i=0; i<N; ++i) {
        ok &= D[i] == i;
    }
    cout << K << endl;
    if(!ok || K != 0 && K % 2 == 1) {
        cout << "NO" << endl;
    } else {
        cout << "YES" << endl;
    }
}