#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <bitset>
#include <utility>

#define rep(i,a,b) for(int i=int(a); i<=int(b); ++i)
#define rev(i,b,a) for(int i=int(b); i>=int(a); --i)
#define rec(i,a,b,c) for(int i=int(a); i<=int(b); i+=int(c))
#define recv(i,a,b,c) for(int i=int(a); i>=int(b); i-=int(c))
#define mp(x,y) make_pair((x),(y))
#define pb(x) push_back(x)
#define all(c) c.begin(), c.end()
#define tr(container, it) for(auto it=(container).begin(); it != (container).end(); ++it)
#define sqr(x) ((x)*(x))
#define sz(a) int((a).size())
#define mod(a,n) ((a) < 0 ? ((n)+(a)) : ((a)%(n)))
#define mout(M,n,m) rep(i,0,(n)-1){ rep(j,0,(m)-1) cout << (M)[i][j] << " ";  cout << "\n"; }
#define vout(A,l,r) rep(i,l,r) cout << A[i] << " ";
using namespace std;

#define INF_ULL ULLONG_MAX
#define INF_LL  LLONG_MAX
#define NINF_LL LLONG_MIN
#define INF_L   LONG_MAX
#define NINF_L   LONG_MIN
#define INF_U   UINT_MAX
#define INF     INT_MAX
#define NINF     INT_MIN

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;

int main(){

  freopen("radixsort.in", "r", stdin);
  freopen("radixsort.out", "w", stdout);

  int N,A,B,C;
  scanf("%d %d %d %d", &N, &A, &B, &C);
  vector<int> V(N);
  V[0] = B;
  rep(i,1,N-1)
    V[i] = (A*V[i-1] + B) % C;

  int ord = 10;
  int pord = 1;
  while(true){
    vector<vector<int> > buckets(10, vector<int>());
    rep(i,0,V.size()-1){
      int idx = (V[i]%ord)/pord;
      buckets[idx].push_back(V[i]);
    }
    int k=0;
    rep(i,0,buckets.size()-1)
      rep(j,0,buckets[i].size()-1)
        V[k++] = buckets[i][j];
    if(buckets[0].size() == N)
      break;
    pord = ord;
    ord *= 10;
  }

  rep(i,0,V.size()-1)
    if(i%10 == 0)
      printf("%d ", V[i]);

  return 0;
}