#include <iostream>
#include <fstream>
#include <cmath>

using namespace std;

int P, N;
unsigned long long a[100000];

void input(){
    ifstream in;
    in.open("farm.in");
    in >> P >> N;
    for(int i=0; i<N; i++){
        in >> a[i];
    }
    in.close();
}

int step(unsigned long long int interval, int depth, unsigned long long n)
{
    if(interval == 1) return depth;
    if(n > 2*interval/3)
        n -= 2*interval/3;
    if(n > interval/3 && n <=2*interval/3 )
        return depth;
    return step(interval/3, depth+1, n);
}

int main()
{
    input();
    ofstream out;
    out.open ("farm.out");

    unsigned long long int interval = pow(3, P);
    for(int i=0; i<N; i++)
        out << step(interval, 1, a[i]) << endl;

    out.close();
    return 0;
}