#include <iostream>
#include<bits/stdc++.h>
typedef long long ll;
const ll m = 1e9;

using namespace std;

int main()
{
    ios_base::sync_with_stdio(NULL);
    cin.tie(nullptr);

    ll h,n;
    cin>>h>>n;

    vector<vector<ll> > dp(h + 1,vector<ll>(26,0));

    for(int j = 0; j<26; j++) dp[0][j] = 1;

    for(int i=1; i< h; i++)
    {
        dp[i][0] = dp[i-1][1] + 1;

        for(int j=1;j<25;j++)
        {
            dp[i][j] = min((ll)INT_MAX,dp[i-1][j-1] + dp[i-1][j+1] + 1);
        }

        dp[i][25] = dp[i-1][24];
    }

    while(n--)
    {
        ll k;
        cin>>k;

        string ans = "";

        int letter = 0;

        while(dp[h - 1][letter] < k)
        {
            k -= dp[h - 1][letter];
            letter++;
        }

        ans += 'a' + letter;

        for(int i = h - 2; i>=0; i--)
        {
            if(k == 1) break;

            k--;

            vector<int> options;
            if(0 < letter)
                options.push_back(letter - 1);
            if(letter < 25)
                options.push_back(letter + 1);

            for(int j: options)
            {
                if(dp[i][j] < k)
                {
                    k -= dp[i][j];
                }
                else
                {
                    ans += 'a' + j;
                    letter = j;
                    break;
                }
            }
        }

        cout<<ans<<"\n";
    }
    return 0;
}