//
// --- Sample implementation for the task swaps ---
//
// To compile this program with the sample grader, place:
//     swaps.h swaps_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ swaps_sample.cpp sample_grader.cpp
// in this folder.
//
#include "swaps.h"

#include <bits/stdc++.h>
using namespace std;

void solve(int N, int V) {
        vector<int> A(N); // A_i is what room the i-th place is currently in
        for(int i=0;i<N;i++) {
                A[i]=i+1;
        }
        for(int it=0;it<N;) {
                for(int i=0;i+1<N;i+=2) {
                        schedule(A[i],A[i+1]);
                } 
                vector<int> v=visit();
                for(int i=0;i+1<N;i+=2) {
                        if(!v[i/2]) {
                                swap(A[i],A[i+1]);
                        }
                }
                it++;
                if(it>=N) break;

                for(int i=1;i+1<N;i+=2) {
                        schedule(A[i],A[i+1]);
                }
                v=visit();
                for(int i=1;i+1<N;i+=2) {
                        if(!v[i/2]) {
                                swap(A[i],A[i+1]);
                        }
                }
                it++;
        }

        // the i-th place item is located at room A_i, so room A_i has the i-th place item
        answer(A);

}