#include <cstdio>
#include <map>
#include <utility>

int a, b;

/*
aaaa
ABCD

(A-a) a^3 + (B-a) a^2 + (C-a) a + (D-a) = 0 mod b
*/

int main(){
  std::map<int, std::pair<int, int> > m;
  scanf("%d%d",&a,&b);

  for(int i=0;i<26;i++){
    for(int j=0;j<26;j++){
      int z = (i * a + j) % b;
      if(m.count(z)){
        std::pair<int, int> p = m[z];
        printf("%c%c\n",'a'+p.first,'a'+p.second);
        printf("%c%c\n",'a'+i,'a'+j);
        return 0;
      }
      m.insert({z, std::pair<int, int>(i, j)});
    }
  }
  int a2 = (long long) a*a%b;
  a2 = a2 == 0 ? 0 : b - a2;
  for(const auto& [val, p]: m){
    if(val == 0) continue;
    int z = (long long) val * a2 % b;
    if(m.count(z)){
      std::pair<int, int> q = m[z];
      puts("aaaa");
      printf("%c%c%c%c\n", 'a'+p.first, 'a'+p.second, 'a'+q.first, 'a'+q.second);
      return 0;
    }
  }

  return 0;
}