#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll INF = 1e13 + 7;

int main(){
    ll m, n;
    cin >> m >> n;

    vector<ll> alap(n);
    ll maxi = 0;
    for(ll &x :alap){
        cin >> x;
        maxi = max(maxi, x);
    }

    vector<vector<ll>> dp(26 + 2, vector<ll>(m + 1, 0));
    for(ll i = 1; i <= 26; i++){
        dp[i][m] = 1;
    }
    for(ll j = m - 1; j >= 1; j--){
        for(ll i = 1; i <= 26; i++){
            dp[i][j] = dp[i - 1][j + 1] + dp[i + 1][j + 1] + 1;
            dp[i][j] = min(dp[i][j], INF);
        }
    }

    for(ll i = 0; i < n; i++){
        ll a = alap[i];

        ll x = 1, y = 1;
        while(a > dp[x][y]){
            a -= dp[x][y];
            x++;
        }

        vector<ll> ans;

        while(1){
            ans.push_back(x);
            if(a == 1){
                break;
            }

            a--;
            if(a > dp[x - 1][y + 1]){
                a -= dp[x - 1][y + 1];
                x++;
                y++;
            } else{
                x--;
                y++;
            }

            assert(y <= m);
        }

        for(ll x : ans){
            cout << (char)(x - 1 + 'a');
        }
        cout << "\n";
    }
}