#include using namespace std; #define F first #define S second #define R cin>> #define Z class #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) templatevoid pr(A a){cout<void pr(A a,B b){cout<void pr(A a,B b,C c){cout<void pr(A a,B b,C c,D d){cout<void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; set s[2]; vector v[2],a; ll T,m; void dfs(ll k,ll x,ll t) { if(x) s[t].in(x); if(k>=v[t].size()) return; rep(i,abs(m)) { dfs(k+1,x+v[t][k]*i,t); } } void Main() { cin >> T >> m; ll x=1; v[0].pb(x); do { x*=m; if(x>=0) v[0].pb(x); else v[1].pb(x); } while(x b; tr(it,s[1]) b.pb(-*it); sort(all(b)); rep(i,T) { if(!a[i]) { pr(0); continue; } rep(j,b.size()) { x=a[i]+b[j]; if(s[0].count(x)) { ll c[33]; mem(c); ll y=b[j]; rrep(l,v[1].size()) { while(y>=-v[1][l]) { c[l*2+1]++; y+=v[1][l]; } } rrep(l,v[0].size()) { while(x>=v[0][l]) { c[l*2]++; x-=v[0][l]; } } rrep(ii,33) { if(c[ii]) { string t=""; rrep(jj,ii+1) { t+=(char)(c[jj]+'0'); } pr(t); break; } } break; } } } } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}