parte2-binlift.cpp

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e5 + 10;
const int MAXLOG = 30;

int prox[MAXLOG + 1][MAXN];

int main() {
  int n, q;
  cin >> n >> q; // só usaremos o valor q no futuro
  for (int x = 1; x <= n; x++) {
    cin >> prox[0][x];
  }
  for (int i = 1; i <= MAXLOG; i++) {
    for (int x = 1; x <= n; x++) {
      prox[i][x] = prox[i-1][[prox[i-1][x]];
    }
  }
}