#include <iostream>
#include <queue>
using namespace std;

int main() {
    int n,k;
    cin >> n >> k;
    queue<int> q;
    int visited[100001] = {0,};
    q.push(n);
    while (true) {
        int tmp = q.top();
        q.pop();
    }
    return 0;
}