#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <vector>
#include <set>
#include <map>

#define forn(i, n) for (int i = 0; i < int(n); i++)
#define fore(i, l, r) for (int i = int(l); i < int(r); i++)
#define all(a) a.begin(), a.end()
#define mp make_pair
#define pb(a) push_back(a)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

//484, Возведите заданную перестановку p в степень k.

void takeDegree(int m, vector<int> &p, int n)
{
    vector<bool> used(p.size());
    vector<vector<int*>> result;
    vector<map<int, int*>> rsrv;
    int counter = -1;
    fore(i, 0, p.size())
    {
        if (!used[i])
        {
            counter++;
            vector<int*> worker;
            map<int, int*> needed;
            int j = i;
            while(!used[j])
            {
                used[j] = true;
                worker.push_back(&p[j]);
                needed[j] = &p[j];
                j = p[j];
            }
            result.push_back(worker);
            rsrv.push_back(needed);
        }
    }

    vector<int> worker(n, -1);
    fore(i, 0, result.size())
    {
        if(m % result[i].size() != 1)
        {
            fore(z, 0, result[i].size())
            {
                worker[*result[i][(z + m % result[i].size()) % result[i].size()]] = *result[i][z];
            }
        }
        else
        {
            for(auto it = rsrv[i].begin(); it != rsrv[i].end(); ++it)
            {
                worker[it->first] = *it->second;
            }
        }

    }
    fore(i, 0, n)
        printf("%d ", worker[i]);

}


int main()
{
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int n, k;
    scanf("%d%d", &n, &k);
    vector<int> v(n);
    forn(i, n)
    {
        int cur;
        scanf("%d", &cur);
        v[i] = cur;
    }
    takeDegree(k, v, n);
    return 0;
}