#include <fstream>
#include <algorithm>
#include <ctime>

using namespace std;

ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

const int bucket=8,lim=(1<<bucket)-1;
int vaz[lim],v[10000010],v1[10000010],n;

int get_num(int x,int ind)
{
    return (x>>(ind*bucket))&lim;
}

int count_sort(int ind)
{
    for(int i=0;i<=lim;i++) vaz[i]=0;
    for(int i=1;i<=n;i++) vaz[get_num(v[i],ind)]++;
    for(int i=1;i<=lim;i++) vaz[i]+=vaz[i-1];
    for(int i=n;i;i--) v1[vaz[get_num(v[i],ind)]--]=v[i];
    for(int i=1;i<=n;i++) v[i]=v1[i];
}



int main()
{
    int a,b,c;
    fin>>a>>b>>c;
    v[1]=b;
    for(int i=2;i<=n;i++) v[i]=(1LL*a*v[i-1]+b)%c;
    for(int i=0;i<32/bucket;i++)
        count_sort(i);
    for(int i=1;i<=n;i+=10) fout<<v[i]<<" ";
    return 0;

}