#include <iostream>
#include <fstream>
using namespace std;

int main()
{
    //ofstream fout("enyem.txt");
    //ifstream fin("be.txt");
    int h, n;
    int utolso=0, aorb=0;
    cin >> h;
    cin >> n;
    int horiginal=h;
    while(h>33){

        aorb=1;
        h--;
        if(h>33){
            aorb=2;
            h--;
        }

    }




    long long a[h][28];
    for(auto& alma:a[1])
    {
        alma=1;
    }
    for(auto& alma:a[0])
    {
        alma=1;
    }
    for(int i=0; i<h; i++){
        a[i][0]=0;
        a[i][27]=0;
    }


    for(int i=1; i<h; i++){
        for(int j=1; j<27; j++){
            a[i][j]=a[i-1][j-1]+a[i-1][j+1];
        }
    }
    for(int i=1; i<h; i++){
        for(int j=1; j<27; j++){
            a[i][j]+=a[i-1][j];
        }
    }
    /*for(auto& xy:a){
        for(auto& yx:xy){
            cout << yx << " ";
        }
        cout << '\n';
    }
*/



    int x;
    int sor = h-1, i;
    string vege;
    for(int it=0; it<n; it++){
        cin >> x;
        int alma=0;
        if(x==horiginal+1){
            alma=1;
        }
        vege.clear();
        utolso=aorb;
        sor=h-1;
        if(utolso==0){
            utolso=1;
            while(x>a[sor][utolso]){
                x-=a[sor][utolso];
                utolso++;
            }
            //vege.push_back(utolso+96);
        }
        else{
            sor=horiginal-1;
            while(sor>31&&x>0){
                x--;
                sor--;
                vege.push_back('a');
                utolso=1;
                if(sor>31&&x>0){
                    x--;
                    sor--;
                    vege.push_back('b');
                    utolso=2;
                }
            }
            x++;
            sor+=1;
            vege.pop_back();
            //cout << vege << endl;
        }
        sor--;

         // cout << "sor: " << sor << endl << "utolso: " << utolso << endl << "x: " << x << endl<< "a[sor][utolso-1] = " << a[sor][utolso-1] << endl << endl;

        while(x>1&&sor>0){

            if(a[sor][utolso-1]>=x-1){
                x--;
                vege.push_back(utolso+96);
                //x-=a[sor][utolso];
                utolso--;
            }
            else{
                vege.push_back(utolso+96);
                x-=a[sor][utolso-1];
                x--;
                utolso++;
            }
            sor--;
            //cout << "sor: " << sor << endl << "utolso: " << utolso << endl << "x: " << x << endl<< "a[sor][utolso-1] = " << a[sor][utolso-1] << endl << endl;


        }
        vege.push_back(utolso+96);
        x--;
        if(x==1){
            if(utolso==1){
                vege.push_back('b');
            }
            else{
                vege.push_back(utolso+95);
            }
        }
        if(alma==1&&horiginal%2==1){
            vege.push_back('c');
        }



        cout << vege << endl;

    }





    return 0;
}