program radixsort;
  var bufout:array [1..100000] of byte;
      n,x,y,z,i:longint;
      a,b:array[1..10000000] of longint;
      count:array[0..99999] of longint;


begin
  assign(input,'radixdort.in');
  reset(input);
  assign(output,'radixsort.out');
  rewrite(output);
  settextbuf(output,bufout);

  readln(n,x,y,z);
  a[1]:=y;
  for i:=2 to n do a[i]:=(a[i-1]*x+y)mod z;
  for i:=1 to n do inc(count[a[i] mod 100000]);
  for i:=1 to 99999 do count[i]:=count[i]+count[i-1];
  for i:=n downto 1 do
    begin
      x:=a[i] mod 100000;
      b[count[x]]:=a[i];
      dec(count[x]);
    end;
  for i:=0 to 99999 do count[i]:=0;
  for i:=1 to n do inc(count[b[i]div 100000]);
  for i:=1 to 99999 do count[i]:=count[i]+count[i-1];
  for i:=n downto 1 do
    begin
      x:=b[i] div 100000;
      a[count[x]]:=b[i];
      dec(count[x]);
    end;
  i:=1;
  while i<=n do
    begin
      write(a[i],' ');
      i:=i+10;
    end;
  close(output);
end.