#include using namespace std; #include using namespace atcoder; using ll = long long; using ld = long double; using P = pair; using Graph = vector>; using vi = vector; using vl = vector; using vll = vector; using vvi = vector; using vvl = vector; using vvll = vector; using vs = vector; using vc = vector; using vvc = vector; using pll = pair; using vpll = vector; using mint = modint1000000007; using mint2 = modint; const long double EPS = 1e-18; const long long INF = 1e18; const long double PI = acos(-1.0L); #define reps(i, a, n) for (ll i = (a); i < (ll)(n); i++) #define rep(i, n) for (ll i = (0); i < (ll)(n); i++) #define rrep(i, n) for (ll i = (1); i < (ll)(n + 1); i++) #define repd(i, n) for (ll i = n - 1; i >= 0; i--) #define rrepd(i, n) for (ll i = n; i >= 1; i--) #define ALL(n) begin(n), end(n) #define IN(a, x, b) (a <= x && x < b) #define INIT \ std::ios::sync_with_stdio(false); \ std::cin.tie(0); template inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; } template inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; } ll N, M, B; int main() { INIT; cin >> N >> M >> B; mint2::set_mod(B); mint2 q = mint2(M).pow(N / 2); cout << "YES" << endl; if (N % 2 == 0) { if (q.val() == 0) { cout << B << " " << B << " " << B << " " << B << " " << B << " " << B << endl; } else { cout << q.val() << " " << B << " " << B << " " << B << " " << B << " " << B << endl; } } else { vll nu(10, 0); rep(i, 6) { ll nn = round(sqrtl(M)); if (nn * nn > M) { nn--; } nu[i] = nn; M -= nn * nn; if (!M) { break; } } rep(i, 6) { mint2 v = q; v *= nu[i]; if (v.val()) { if (i != 5) { cout << v.val() << " "; } else { cout << v.val() << endl; } } else { if (i != 5) { cout << B << " "; } else { cout << B << endl; } } } } }