#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#include <experimental/iterator>
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(const char *s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(const char *s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int a, b;
  cin >> a >> b;
  auto h = [&](string_view s) {
    int64_t r = 0;
    for (auto c : s)
      r = (r * a + (c - 'a' + 1)) % b;
    return r;
  };
  mt19937 rnd(7122);
  uniform_int_distribution<int> C(0, 12);
  unordered_map<int, unordered_set<string>> ans;
  while (true) {
    string s;
    for (int i = 0; i < 7; ++i)
      s += C(rnd) + 'a';
    int hh = h(s);
    ans[hh].insert(s);
    if (ans[hh].size() == 2)
      break;
  }

  for (const auto &[_, v] : ans) {
    if (v.size() != 2)
      continue;
    vector<string> vs(v.begin(), v.end());
    for (int i = 0; i < 100; ++i) {
      for (int j = 0; j < 7; ++j) {
        cout << vs[(i >> j) & 1];
      }
      cout << '\n';
    }
  }
  return 0;
}