#include <bits/stdc++.h> using namespace std; template<typename T> void out(T x) { cout << x << endl; exit(0); } #define watch(x) cout << (#x) << " is " << (x) << endl using ll = long long; const ll mod = 1e9+7; const int maxn = 1e6 + 5; int n; ll k; int a[maxn]; ll ways[maxn]; int viz[maxn]; int par[maxn]; int dfs(int at, ll k) { if (k==0) return at; if (viz[at]) { vector<int> v={at}; for (int x=a[at]; x!=at; x=a[x]) { v.push_back(x); } int len = v.size(); k %= len; return v[k]; } viz[at]=1; par[a[at]]=at; return dfs(a[at],k-1); } void solve() { for (int i=0; i<n; i++) { viz[i]=0; par[i]=-1; } int dest = dfs(0, k); ways[dest]++; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>>n>>k; for (int i=0; i<n; i++) { cin>>a[i]; --a[i]; } for (int i=0; i<n; i++) { for (int j=0; j<n; j++) { //cout<<i<<": "<<j<<endl; int save=a[i]; a[i]=j; solve(); a[i]=save; } } for (int i=0; i<n; i++) { cout<<ways[i]<<"\n"; } return 0; }