#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

mt19937 rng;

int rand(int a, int b)
{
	return rng() % (b - a) + a;
}

int a, b;

int hs(string& s)
{
	LL h = 0;
	FOR (i, 0, SZ(s))
		h = (h * a + (s[i] - 'a' + 1)) % b;
	return h;
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	
	cin >> a >> b;
	
	unordered_map<int, string> m;
	m.reserve(1e6);
	
	while (true)
	{
		string s = "";
		FOR (i, 0, 7)
		{
			s += ('a' + rand(0, 26));
		}
		int h = hs(s);
		if (m.count(h))
		{
			if (m[h] == s)
				continue;
			string t = m[h];
			set<int> hashes;
			FOR (mask, 0, 100)
			{
				string ans = "";
				FOR (k, 0, 7)
				{
					if (mask & (1 << k))
						ans += s;
					else
						ans += t;
				}
				hashes.insert(hs(ans));
				cout << ans << '\n';
			}
			assert(SZ(hashes) == 1);
			return 0;
		}
		m[h] = s;
	}
	
	return 0;
}