// Source: https://usaco.guide/general/io

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

const long long LIM = 1e18;

string s(int ch,int mxl,vector<array<int,26>> &hany, int k){
    if(mxl==0||k==1)return "";
    k--;
    if(ch==0){
        return 'b'+s(ch+1,mxl-1,hany,k);
    }
    if(ch==25){
        return 'y'+s(ch-1,mxl-1,hany,k);
    }
    if(hany[mxl][ch-1]>=k){
        char c='a'+(ch-1);
        return c+s(ch-1,mxl-1,hany,k);
    }
    char c='a'+(ch+1);
    k-=hany[mxl][ch-1];
    return c+s(ch+1,mxl-1,hany,k);

}


signed main() {
    int n,h;cin>>h>>n;
    vector<array<int,26>> dp(h+1),hany(h+1);
    for(int i = 0;i<26;i++){
        dp[1][i]=1;
        hany[1][i]=1;
    }
    for(int i = 2;i<=h;i++){
        for(int j = 0;j<26;j++){
            dp[i][j]=min(LIM,(j>0?dp[i-1][j-1]:0)+(j<25?dp[i-1][j+1]:0));
            hany[i][j]=min(LIM,hany[i-1][j]+dp[i][j]);
        }
    }
    /*for(int j = 0;j<26;j++){
        cout<<j<<": ";
        for(int i = 1;i<=h;i++){
            cout<<hany[i][j]<<", ";
        }cout<<endl;
    }*/
    while(n--){
        int k;cin>>k;
        string ans="";
        int kezdobet=0;
        for(int i = 0;i<26;i++){
            if(k<=hany[h][i]){
                kezdobet=i;
                break;
            }
            k-=hany[h][i];
        }
        ans+='a'+kezdobet;
        ans+=s(kezdobet,h-1,hany,k);
        cout<<ans<<endl;
    }
}