#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 101001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;
//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
unordered_map <ll, vector <ll> > koler;
int main()
{
//freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll c, b, d, m;
cin >> c >> d >> b >> m;
ll dob = 1;
if (b >= 50) dob = b - 1;
for (ll i = 1; ; i += dob)
{
ll val = i * c + d;
ll sum = 0;
while (val > 0)
{
sum += val % b;
val /= b;
}
koler[sum].pb(i);
if (sz(koler[sum]) == m)
{
for (auto it : koler[sum]) cout << it << " ";
exit(0);
}
}
}
