#include using namespace std; typedef pair pii; typedef long long ll; const int N = 2000010, MOD = 1e9 + 7, INF = 0x3f3f3f3f; int n, m, w[N]; void solve() { int a, b; scanf("%d%d%d", &n, &a, &b); ll t = 1; for (int i = 0; i < n; i++) printf("%lld\n", a * t), t *= b; } int main() { int T = 1; // cin >> T; while (T--) solve(); return 0; }