#include <cmath>
#include <cstdio>
#include <iostream>

using namespace std;

typedef unsigned long long ULL;

const int MAXN = 100000;
//P <= 33

int P,N;
ULL ar[MAXN];

void init()
{
	cin >> P >> N;
	for(int i=0; i<N; i++) cin >> ar[i];
}

int getIteration(ULL number)
{
	ULL from=1, to=1;
	for(int i=0; i<P; i++) to *= 3;
	
	ULL lowMid,highMid,delta;
	int iteration = 1;
	
	while(from < to)
	{
		delta = to-from;
		lowMid = from + delta/3;
		highMid = to - delta/3;
		
		if(number <= lowMid) to = lowMid;
		else if(number >= highMid) from = highMid;
		else break;
		
		iteration++;
	}
	
	return iteration;
}

void solve()
{
	for(int i=0; i<N; i++) printf("%d\n", getIteration(ar[i]));
}

int main()
{
	//freopen("octopacas.in", "r", stdin);
	//freopen("octopacas.out", "w", stdout);
	
	cin.sync_with_stdio(false);
	
	init();
	solve();
	
	/*
	
	for(ULL i=0; i<100000; i++) printf("%d\n", getIteration(i));
	
	if(true) return 0;
	for(int i=40000; true; i++)
	{
		a = pow(3, (double)(i)/2000.0);
		if(a == prev) continue;
		if(a > lim) break;
		
		tmp = getIteration(a);
		for(int j=0; j<tmp; j++) printf(" ");
		//printf("| %d %lld\n", tmp, a-prev);
		printf("|\n", tmp, a-prev);
		
		prev = a;
	}
	while(1)
	{
		cin >> a;
		printf("%d\n", getIteration(a));
	}
	*/
	
	return 0;
}