#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

int MOD;

int add(int a, int b) {
  return a + b >= MOD ? a + b - MOD : a + b;
}

int sub(int a, int b) {
  return a >= b ? a - b : a + MOD - b;
}

int mul(int a, int b) {
  return (1ll * a * b) % MOD;
}

int B;

int get_h(string s) {
  int h = 0;
  for (auto ch : s) {
    h = add(mul(h, B), ch - 'a' + 1);
  }
  return h;
}

const int MAXMOD = 1e9;
bitset<MAXMOD / 25 + 1> used;

string s;

string t;

void go2(int hsh, int goal) {
  if ((int)t.size() == 6) {
    hsh = mul(hsh, B);
    if (hsh / 25 != goal / 25) return;
    int h1 = goal;
    s.push_back('a');
    t.push_back('a');
    swap(s, t);
    if (h1 > hsh) {
      s.back() += (h1 - hsh);
    } else {
      t.back() += (hsh - h1);
    }
    vector<int> all;
    for (int i = 0; i < 100; ++i) {
      string cur;
      for (int j = 0; j < 7; ++j) {
        if (i & (1 << j)) {
          cur += s;
          cout << s;
        } else {
          cur += t;
          cout << t;
        }
      }
      all.push_back(get_h(cur));
      cout << "\n";
    }
    sort(all.begin(), all.end());
    assert(all[0] == all.back());
    exit(0);
  }
  for (int i = 0; i < 26; ++i) {
    t.push_back('a' + i);
    int hsh1 = add(mul(hsh, B), i + 1);
    go2(hsh1, goal);
    t.pop_back();
  }
}

void go(int hsh) {
  if ((int)s.size() == 6) {
    hsh = mul(hsh, B);
    int id = hsh / 25;
    if (used[id]) {
      cerr << "found" << endl;
      go2(0, hsh);
    }
    used[id] = 1;
    return;
  }
  for (int i = 0; i < 26; ++i) {
    s.push_back('a' + i);
    int hsh1 = add(mul(hsh, B), i + 1);
    go(hsh1);
    s.pop_back();
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  cin >> B >> MOD;
  go(0);

  return 0;
}