#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
using ll = long long;

struct UnionFind {
    vector<int> data;

    UnionFind(int sz) {
        data.assign(sz, -1);
    }

    bool unite(int x, int y) {
        x = find(x), y = find(y);
        if (x == y) return (false);
        if (data[x] > data[y]) swap(x, y);
        data[x] += data[y];
        data[y] = x;
        return (true);
    }

    int find(int k) {
        if (data[k] < 0) return (k);
        return (data[k] = find(data[k]));
    }

    int size(int k) {
        return (-data[find(k)]);
    }
};

int main() {
    int n;
    ll k;
    cin >> n >> k;

    UnionFind uf(n);
    for (int i = 0; i < n; i++) {
        int d;
        cin >> d;
        uf.unite(i, d - 1);
    }

    for (int i = 0; i < n; i++) {
        if (uf.find(i) == i) k -= uf.size(i) - 1;
    }

    cout << (k >= 0 && k % 2 == 0 ? "YES" : "NO") << endl;
    return 0;
}