#include <iostream>

#include <cstdio>

#include <algorithm>

#include <cstring>

using namespace std;

const int maxn=;

int a[maxn];

int n,b;

int main()

{

    scanf("%d %d",&n,&b);

    int cnt=;

    int tmp=n;

    if(tmp==){

        cnt=;

        a[]=;

    }

    while(tmp){

        a[cnt]=tmp%b;

//printf("cnt:%d a:%d\n",cnt,a[cnt]);

        cnt++;

        tmp=tmp/b;

    }

    bool flag=true;

    for(int i=;i<=cnt/;i++){

        if(a[i]!=a[cnt--i]){

            flag=false;

            break;

        }

    }

    if(flag)

        printf("Yes\n");

    else

        printf("No\n");

    printf("%d",a[cnt-]);

    for(int i=cnt-;i>=;i--){

        printf(" %d",a[i]);

    }

    printf("\n");

    return ;

}