123AC, 4 (520ms) 5 (700ms) TLE

#include <iostream>
#include <cstdio>
using namespace std;

int p;

unsigned long long pow_(unsigned long long base, unsigned long long exp_) {
	unsigned long long ans = 1;
	while (exp_) {
		if (exp_ % 2) {
			exp_--;
			ans *= base;
		}
		exp_ /= 2;
		base *= base;
		ans %= p;
		base %= p;
	}
	return ans;
}

int main() {
    int n;
    cin >> n >> p;
    for (int i = 1; i <= n; i++) {
        printf("%lld\n", pow_(i, p - 2));
    }
}

QwQ troll:()