#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#include <algorithm>
#include <cmath>
 
#include <string>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <valarray>

//#include <random>//xAOJ
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
/////////
using namespace::std;
/////////
/////////
unsigned long long get_hash(string s, unsigned long long a, unsigned long long b){
	unsigned long long hash = 0;

	for(unsigned int i = 0; i < s.size(); i++){
		hash = (hash * a + s[i]) % b;
	}

	return hash;
}

void solve(){
	int AA,BB;
	cin >> AA >> BB;
	vector<int> TEMP(100001,-1);
	int count = 0;
	int value = 1;
	TEMP[value] = count;
	++count;
	pair<int,int> ans;
	for(;;){
		value = (value * AA) % BB;
		//cout << value << endl;
		if(TEMP[value] != -1 ){
			ans.first = TEMP[value];
			ans.second = count;
			break;
		}else{
			TEMP[value] = count;
			++count;
		}
	}
	string S(count+1,'a');
	string T(count+1,'a');
	S[ans.first] = 'b';
	T[ans.second] = 'b';
	cout << S << endl;
	cout << T << endl;
	//cout << get_hash(S,AA,BB) << endl;
	//cout << get_hash(T,AA,BB) << endl;
}

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    cout << setprecision(16);//
	
	//cpp
	solve();
	return 0;
}