#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <math.h>
#include <array>

using namespace std;
using ll = long long;

ll inf = 2e9;
vector<vector<ll>> dp, pref;
string ans;

void find(int remaining, int depth = 0, int letter = -1)
{
	if (remaining == 0) return;
	if (depth == 0)
	{
		ans = "";
		for (letter = 0; letter < 26; letter++)
		{
			if (pref[letter].back() >= remaining) break;
			remaining -= pref[letter].back();
		}
		ans += 'a' + letter;
		return find(remaining-1, depth + 1, letter);
	}
	if (0 < letter && pref[letter-1][pref[0].size() - 1 - depth] >= remaining)
	{
		ans += 'a' + letter - 1;
		return find(remaining-1, depth + 1, letter - 1);
	}
	else
	{
		ans += 'a' + letter + 1;
		return find(remaining-1 - (0 < letter ? pref[letter-1][pref[0].size()-1-depth] : 0), depth + 1, letter + 1);
	}
}

signed main()
{
	iostream::sync_with_stdio(0);
	cin.tie(0);

	int h, n, k, i, j;
	cin >> h >> n;

	dp.resize(26, vector<ll>(h+1));
	pref.resize(26, vector<ll>(h+1));
	for (i = 0; i < 26; i++) dp[i][1] = 1, pref[i][1] = 1;
	
	for (j = 2; j < h+1; j++)
	{
		for (i = 0; i < 26; i++)
		{
			dp[i][j] = min(inf, (i > 0 ? dp[i-1][j - 1] : 0) + (i < 25 ? dp[i+1][j - 1] : 0));
			pref[i][j] = pref[i][j - 1] + dp[i][j];
		}
	}
	
	while (n--)
	{
		int idx;
		cin >> idx;
		find(idx);
		cout << ans << '\n';
	}
}