#include<bits/stdc++.h>
#define irep(i,l,r) for(int i = l; i <= r; ++i)
#define drep(i,r,l) for(int i = r; i >= l; --i)
#define ceil(pp,qq) (((pp)>0)^((qq)>0)?-Abs(pp)/Abs(qq):(pp)%(qq)?(pp)/(qq)+1:(pp)/(qq))
#define floor(pp,qq) (((pp)>0)^((qq)>0)?-ceil(abs(pp),abs(qq)):(pp)/(qq))
#define ll long long
using namespace std;
ll Abs(ll x){return x > 0 ? x : - x;}
inline ll read(){
	char ch = getchar();
	ll s = 0; bool w = 0;
	while(!isdigit(ch)){if(ch == '-')w = 1;ch = getchar();}
	while(isdigit(ch))s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
	return w ? - s : s;
}

const int itinf = 2e9;
const ll llinf = 4e18;
const int mod = 1000000007;
const int N = 500009;
ll a = read(), md = read();

map<ll, string>mp;
ll hs;
int ok = 0;
string f[2];
int main(){
	srand(020201231);
	while(1){
		string s;
		ll hs = 0;
		irep(i,0,6){
			char ch = 'a' + rand() % 26;
			s = s + ch;
			hs = (hs * a + ch - 'a') % md;
		}
		if(mp.find(hs) == mp.end())mp[hs] = s;
		else{
			f[0] = s, f[1] = mp[hs];
			break;
		}
	}
	for(int s = 0; s < 100; ++ s){
		for(int i = 0; i < 7; ++ i){
			if(s & (1 << i))cout << f[0];
			else cout << f[1];
		}
		putchar('\n');
	}
	return 0;
}