#include <climits>
#include <iostream>
#include <vector>

using namespace std;

using ll = long long;

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

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

    vector<vector<ll>> dp(h, 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] + 1;
    }

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

        string s = "";

        // first character
        int last = 0;

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

        s.push_back('a' + last);

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

            vector<int> continuations;
            if (last > 0)
                continuations.push_back(last - 1);
            if (last < 25)
                continuations.push_back(last + 1);

            for (int j : continuations) {
                if (dp[i][j] >= k) {
                    s.push_back('a' + j);
                    last = j;
                    break;
                }

                k -= dp[i][j];
            }
        }

        cout << s << "\n";
    }
}