#include <fstream>
#include <deque>

using namespace std;

const int NMAX = 10000005;

ifstream fin("radixsort.in");
class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
}fout("radixsort.out");

int N, A, B, C;
int v[NMAX];
deque <int> bucket[260];

int main()
{

    fin >> N >> A >> B >> C;
    v[1] = B;
    for (int i = 2;i <= N;++i)
        v[i] = (1LL * A * v[i - 1] + B) % C;
    for (int p = 0;p < 4;++p)
    {
        for (int i = 1;i <= N;++i)
        {
            int val = (v[i] >> (8 * p)) & 255;
            bucket[val].push_back(v[i]);
        }
        N = 0;
        for (int i = 0;i < 256;++i)
        {
            while (!bucket[i].empty())
            {
                v[++N] = bucket[i].front();
                bucket[i].pop_front();
            }
        }
    }
    for (int i = 1;i <= N;i += 10)
        fout << v[i] << " ";
    return 0;
}