#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long &a) {
  a %= MOD;
  (a < 0) && (a += MOD);
}
inline long long modMul(long long a, long long b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a * b) % MOD;
}
inline long long modAdd(long long a, long long b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a + b) % MOD;
}
inline long long modSub(long long a, long long b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long modPow(long long b, long long p) {
  long long r = 1;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1;
  }
  return r;
}
inline long long modInverse(long long a) { return modPow(a, MOD - 2); }
inline long long modDiv(long long a, long long b) {
  return modMul(a, modInverse(b));
}
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
char g[10][10];
int dis[10][10];
int v[100];
void ___k(long long p, long long k) {
  vector<long long> rs;
  long long x = 0;
  while (p) {
    v[x] = p % k;
    cerr << p << " " << v[x] << endl;
    if (v[x] < 0) v[x] += k;
    p = (v[x] - p) / k;
    x++;
  }
  cout << x << endl;
  for (int i = int(0); i < int(x); ++i) cout << v[i] << " ";
  puts("");
}
int main() {
  long long p, k;
  while (scanf("%lld %lld", &p, &k) == 2) {
    ___k(p, k);
  }
}
