#include <bits/stdc++.h>
using namespace std;
long long modpow(long long a, long long b, long long m){
  long long ans = 1;
  while (b > 0){
    if (b % 2 == 1){
      ans *= a;
      ans %= m;
    }
    a *= a;
    a %= m;
    b /= 2;
  }
  return ans;
}
int main(){
  long long N;
  int M, B;
  cin >> N >> M >> B;
  long long x = modpow(M, N / 2, B);
  if (x == 0){
    x = B;
  }
  if (N % 2 == 0){
    assert(x * x % B == modpow(M, N, B));
    cout << "YES" << endl;
    cout << x << ' ' << B << ' ' << B << ' ' << B << ' ' << B << ' ' << B << endl;
  } else {
    vector<int> C(6, 0);
    for (int i = 0; i < 6; i++){
      for (int j = M; j >= 0; j--){
        if (j * j <= M){
          C[i] = j * j;
          M -= j * j;
          break;
        }
      }
    }
    cout << "YES" << endl;
    for (int i = 0; i < 6; i++){
      long long ans = (long long) C[i] * x % B;
      if (ans == 0){
        ans = B;
      }
      cout << ans;
      if (i < 5){
        cout << ' ';
      }
    }
    cout << endl;
  }
}