#include <cstdio>
#include <cstring>

using namespace std;

int n,a,b,c,i;
int v[10000001];
int t[10000001];
int ind[301],cont[301];

inline void radix(int a[], int n);
inline void rad(int n, int byte, int a[], int b[]);

int main()
{
    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);
    scanf("%d%d%d%d",&n,&a,&b,&c);
    v[1]=b;
    for (i=1;i<=n;i++) v[i]=((long long)a*v[i-1]+b)%c;

    radix(v,n);

    for (i=1;i<=n;i+=10) printf("%d ",v[i]);

    fclose(stdin);
    fclose(stdout);
    return 0;
}

inline void rad(int n, int byte, int a[], int b[])
{
    int cnt[256], ind[256],i;
    memset(cnt, 0, sizeof(cnt));
    for(i=1; i <= n; ++i) ++cnt[(a[i]>>byte)&255];
    ind[0]=1;
    for(i=1; i < 256; ++i) ind[i]=ind[i-1]+cnt[i-1];
    for(i=1; i <= n; ++i) b[ind[(a[i]>>byte)&255]++]=a[i];
}

inline void radix(int a[], int n)
{
    rad(n, 0, a, t);
    rad(n, 8, t, a);
    rad(n, 16, a, t);
    rad(n, 24, t, a);
}

/*
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <fstream>
#include <algorithm>
#define N 1000001
#define dim 8192

char ax[dim];
int pz;

char bx[dim];
int pz2;

inline void cit(int &x)
{
    x=0;
    while(ax[pz]<'0' || ax[pz]>'9')
        if(++pz==dim)fread(ax,1,dim,stdin),pz=0;
    while(ax[pz]>='0' && ax[pz]<='9')
    {
        x=x*10+ax[pz]-'0';
        if(++pz==dim)fread(ax,1,dim,stdin),pz=0;
    }
}


inline void afis(int x)
{
    //printf("%d ", x);
    int t=0;
    while(x) t=t*10+x%10, x/=10;

//  printf("%d\n", t);

    while(t)
    {
        bx[pz2]=t%10 + '0';
        t/=10;
        if(++pz2 == dim) fwrite(bx, 1, dim, stdout),memset(bx, 0, sizeof(bx)),pz2=0;
    }

    bx[pz2]=' ';
    if(++pz2 == dim) fwrite(bx,1,dim,stdout),memset(bx, 0, sizeof(bx)),pz2=0;

}

int a[N], b[N];

inline void rad(int n, int byte, int a[], int b[])
{
    int cnt[256], ind[256],i;
    memset(cnt, 0, sizeof(cnt));
    for(i=1; i <= n; ++i) ++cnt[(a[i]>>byte)&255];
    ind[0]=1;
    for(i=1; i < 256; ++i) ind[i]=ind[i-1]+cnt[i-1];
    for(i=1; i <= n; ++i) b[ind[(a[i]>>byte)&255]++]=a[i];
}

inline void radix(int a[], int n)
{
    rad(n, 0, a, b);
    rad(n, 8, b, a);
    rad(n, 16, a, b);
    rad(n, 24, b, a);
}

inline void scrie(int x)
{
    char lin[33], *s=lin+30;
    s[0]=0;
    do
    {
        int cat=x/10;
        --s;
        s[0]=x-cat*10+'0';
        x=cat;
    }while(x);
    printf("%s ", s);
}

int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    //ofstream g("algsort.out");
    int n,i;
    cit(n);
    for(i=1;i<=n;++i) cit(a[i]);

    radix(a,n);
    //sort(a+1,a+n+1);
    for(i=1;i<=n;++i) scrie(a[i]);//printf("%d ", a[i]);
    //fwrite(bx, 1, dim, stdout);
    return 0;
}
/*
#include <cstdio>
#include <cstring>

using namespace std;

int n,a,b,c,i;
int v[10000001];
int t[10000001];
int ind[301],cont[301];
int cod(int nr,int i)
{
    return ((nr>>(i<<3))&255);
}
void cif(int a[],int b[],int x)
{
    int i;
    for (i=0;i<=256;i++) ind[i]=cont[i]=0;
    for (i=1;i<=n;i++)
        cont[cod(a[i],x)]++;
    for (i=1;i<=255;i++)
        ind[i]=ind[i-1]+cont[i-1];
    for (i=1;i<=n;i++)
        b[++ind[(cod(a[i],x))]]=a[i];
}

int main()
{
    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);
    scanf("%d%d%d%d",&n,&a,&b,&c);
    v[1]=b;
    for (i=1;i<=n;i++) v[i]=((long long)a*v[i-1]+b)%c;
    for (i=0;i<=3;i++)
        if (i&1)
            cif(t,v,i);
        else
            cif(v,t,i);
    for (i=1;i<=n;i+=10) printf("%d ",v[i]);

    fclose(stdin);
    fclose(stdout);
    return 0;
}
*/

/*
#include <algorithm>
#include <cassert>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <cstdio>
#include <map>
#include <set>
#include <sstream>
#include <vector>

using namespace std;

#define MAX_N 10000000 + 1
#define RADIX 0xFF
#define RADIX_SIZE 8
#define TOTAL_BYTES sizeof(numbers[0])

int n;
int numbers[MAX_N];

#define get_byte(x) ((x>>(byte * 8))&RADIX)

void countsort(int A[], int B[], int byte) {
    int counter[1<<RADIX_SIZE];
    int index[1<<RADIX_SIZE];

    memset(counter, 0, sizeof(counter));

    for(int i = 0; i < n; i ++)
        ++counter[get_byte(A[i])];

    index[0] = 0;

    for(int i = 1; i < 1<<RADIX_SIZE; i ++)
        index[i] = index[i-1] + counter[i-1];

    for(int i = 0; i < n; i ++)
        B[index[get_byte(A[i])]++] = A[i];
}
void radixsort() {
    int *temp = new int[n]; // avem nevoie de un array ca spatiu temporar
    for (int i = 0; i < TOTAL_BYTES; i ++) {
        if(i % 2 == 0)
            countsort(numbers, temp, i);// sortez dupa byte-ul i
        else
            countsort(temp, numbers, i);
    }
}
void read()
{
    int a,b,c;
    scanf("%d%d%d%d", &n, &a, &b, &c);

    numbers[0] = b % c;
    for(int i = 1; i < n; i ++)
        numbers[i] = (1LL * a * numbers[i-1] % c + b) % c;
}
void write()
{
    for(int i = 0; i < n; i +=10)
        printf("%d ", numbers[i]);
    printf("\n");
}

int main()
{
    freopen("radixsort.in", "rt", stdin);
    freopen("radixsort.out", "wt", stdout);

    read();

    radixsort();
//    sort(numbers, numbers + n);

    write();

    fclose(stdin);
    fclose(stdout);
    return 0;
}
*/
/*
#include<stdio.h>
#define MAX 20
#define SHOWPASS
#define BASE 10
void print(int *a, int n)
{
  int i;
  for (i = 0; i < n; i++)
    printf("%d\t", a[i]);
}

void radixsort(int *a, int n)
{
  int i, b[MAX], m = a[0], exp = 1;
  for (i = 1; i < n; i++)
  {
    if (a[i] > m)
      m = a[i];
  }

  while (m / exp > 0)
  {
    int bucket[BASE] ={  0 };
    for (i = 0; i < n; i++)
      bucket[(a[i] / exp) % BASE]++;
    for (i = 1; i < BASE; i++)
      bucket[i] += bucket[i - 1];
    for (i = n - 1; i >= 0; i--)
      b[--bucket[(a[i] / exp) % BASE]] = a[i];
    for (i = 0; i < n; i++)
      a[i] = b[i];
    exp *= BASE;

    #ifdef SHOWPASS
      printf("\nPASS   : ");
      print(a, n);
    #endif
  }
}

int main()
{
  int arr[MAX];
  int i, n;
  printf("Enter total elements (n <= %d) : ", MAX);
  scanf("%d", &n);
  n = n < MAX ? n : MAX;

  printf("Enter %d Elements : ", n);
  for (i = 0; i < n; i++)
    scanf("%d", &arr[i]);

  printf("\nARRAY  : ");
  print(&arr[0], n);

  radixsort(&arr[0], n);

  printf("\nSORTED : ");
  print(&arr[0], n);
  printf("\n");

  return 0;
}
*/