#include <bits/stdc++.h>
using namespace std;
inline long long mod(long long n, long long m) {
  long long ret = n % m;
  if (ret < 0) ret += m;
  return ret;
}
long long gcd(long long a, long long b) {
  return (b == 0LL ? a : gcd(b, a % b));
}
long long exp(long long a, long long b, long long m) {
  if (b == 0LL) return 1LL;
  if (b == 1LL) return mod(a, m);
  long long k = mod(exp(a, b / 2, m), m);
  if (b & 1LL) {
    return mod(a * mod(k * k, m), m);
  } else
    return mod(k * k, m);
}
const long long N = 2020;
long long a[N];
long long pre[N][2];
long long get(long long l, long long r, long long j) {
  return pre[r][j] - pre[l - 1][j];
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long p, k;
  cin >> p >> k;
  vector<long long> res;
  while (p != 0) {
    long long a = p % (-k);
    p /= -k;
    if (a < 0) {
      a += k;
      p++;
    }
    res.push_back(a);
  }
  cout << (long long)res.size() << "\n";
  for (long long x : res) cout << x << " ";
  cout << "\n";
}
