#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())


ll w[100];
ll a, b;

const int C = 1000000;
vector<pair<ll, string>> v, v0;
string s = "verylongstringtostartwith";

void gen(int bs) {
    while (SZ(v) < C) {
        ll sum = 0;
        for (int i = 0; i < 25; i++)
            s[i] = rand() % 26 + 'a', sum += (s[i] - 'a' + 1) * w[i + bs];
        v.pb({sum % b, s});
    }
}

ll cal(string t) {
    ll h = 0;
    for (char c : t)
        h = (h * a + (c - 'a' + 1)) % b;
    return h;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    srand(chrono::system_clock::now().time_since_epoch().count());
    cin >> a >> b;
    w[49] = 1;
    for (int i = 48; i >= 0; i--)
        w[i] = w[i + 1] * a % b;

    v.clear();
    
    gen(0);
    v0 = v;
    sort(ALL(v0));

    v.clear();
    gen(25);

    ll g = cal(v0[0].Y + v[0].Y);

    set<string> ans;
    for (auto &p : v) {
        if (SZ(ans) == 100)
            break;
        ll need = (g -p.X + b) % b;        
        int i = lower_bound(ALL(v0), pair<ll, string>(need, "")) - v0.begin(); 
        while (i < SZ(v0) && v0[i].X == need && SZ(ans) < 100)
            ans.insert(v0[i].Y + p.Y), i++;
    }
    assert(SZ(ans) == 100);

    for (auto x : ans) {
        assert(cal(x) == g);
        cout << x << endl;
    }



    
}