#include <bits/stdc++.h>

using namespace std;

int main(){
    int n, b, p;
    long long a_i, ostatok;
    vector<int> v;
    vector<int> answer;

    cin >> n >> b >> p;
    ostatok = b % p;
    a_i = ostatok;
    for (int i = 1; i <= n; i++) {
        v.push_back(a_i);
        a_i = (a_i * ostatok) % p;
    } v.push_back(a_i);

    for (int i = 1; i < n; i++) {
        auto smallest = min_element(v.begin(), v.end());
        auto biggest = max_element(v.begin(), v.end());
        v.erase(v.begin() + distance(std::begin(v), biggest));
        v.erase(v.begin() + distance(std::begin(v), smallest));
        v.push_back((smallest[0] + biggest[0]) % p);
        answer.push_back((smallest[0] + biggest[0]) % p);
    }
    for (int i = 0; i < n-1; i++) {
        cout << answer[i];
    }



    return 0;
}