#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<vector>
using namespace std;
queue <pair< long long, long long> > p;
long long rt=0,cur=1,n,pa,a;
void check(long long start, long long finale, long long lenght, long long x)
{
    if(finale==start)
    {
        if(x==finale)rt=cur;
        return ;
    }
    if(rt!=0)return;
    if(x>=start+lenght&&x<=(start-1)+2*lenght)
    {
        rt=cur;
    }
    cur++;
    check(start, start+lenght-1, lenght/3, x);
    check((start-1)+2*lenght+1,finale, lenght/3, x);
    cur--;
}
int main()
{
    freopen("farm.in","r",stdin);
    freopen("farm.out","w",stdout);
    scanf("%lld%lld",&pa,&n);
    long long power=1;
    for(int i=1;i<=pa;i++)
        power*=3;
    for(int i=1;i<=n;i++)
    {
        scanf("%lld",&a);
        rt=0;
        cur=1;
        check(1,power,power/3,a);
        cout<<rt<<endl;
    }
    return 0;
}