#include <stdio.h>

long long power_mod (long long a, long long b, long long mod_num) {
  long long ans = 1LL;
  
  if (b > 0LL) {
    ans = power_mod(a, b/2LL, mod_num);
    ans = (ans * ans) % mod_num;
    if (b%2LL == 1LL) {
      ans = (a * ans) % mod_num;
    }
  }
  
  return ans;
}

int main () {
  long long n = 0LL;
  long long m = 0LL;
  long long b = 0LL;
  
  int res = 0;
  
  long long rem = 0LL;
  long long x[6] = {};
  
  int is_ok = 0;
  
  res = scanf("%lld", &n);
  res = scanf("%lld", &m);
  res = scanf("%lld", &b);
  
  rem = power_mod(m, n, b);
  
  for (int i = 0; i < 2; i++) {
    long long ans[2] = { 0LL, b };
    while (ans[1]-ans[0] > 1LL) {
      long long nxt = (ans[0]+ans[1])/2LL;
      if (nxt*nxt <= rem) {
        ans[0] = nxt;
      } else {
        ans[1] = nxt;
      }
    }
    x[i] = ans[0];
    if (x[i] <= 0LL) {
      x[i] = b;
    } else {
      rem -= x[i]*x[i];
    }
  }
  
  for (long long i = 0LL; i*i <= rem; i += 1LL) {
    for (long long j = 0LL; j*j <= rem-i*i; j += 1LL) {
      for (long long l = 0LL; l*l <= rem-i*i-j*j; l += 1LL) {
      long long tmp_rem = rem-i*i-j*j-l*l;
      long long k[2] = { 0LL, tmp_rem };
      while (k[1]-k[0] > 1LL) {
        long long nxt = (k[0]+k[1])/2LL;
        if (nxt*nxt <= tmp_rem) {
          k[0] = nxt;
        } else {
          k[1] = nxt;
        }
      }
      if (k[0]*k[0] == tmp_rem) {
        x[2] = l;
        x[3] = i;
        x[4] = j;
        x[5] = k[0];
        if (x[2] <= 0LL) {
          x[2] = b;
        }
        if (x[3] == 0LL) {
          x[3] = b;
        }
        if (x[4] == 0LL) {
          x[4] = b;
        }
        if (x[5] == 0LL) {
          x[5] = b;
        }
        }
      }
    }
  }
  
  printf("YES\n");
  printf("%lld", x[0]);
  for (int i = 1; i < 6; i++) {
    printf(" %lld", x[i]);
  }
  printf("\n");
  
  return 0;
}