#include <bits/stdc++.h>
using namespace std;
int k, s, luu;
int F[100000];
int a[100000];
int res;
int main() {
  cin >> s >> k;
  F[0] = 1;
  F[1] = 1;
  for (int i = 2; i <= 10000; i++) {
    F[i] = 2 * F[i - 1];
    if (i >= k + 1) F[i] -= F[i - k - 1];
    if (F[i] > 1000000000) {
      luu = i;
      break;
    }
  }
  for (int i = luu; i >= 0; i--)
    if (s >= F[i]) {
      res++;
      a[res] = F[i];
      s -= F[i];
    }
  res++;
  cout << res << endl;
  cout << 0 << " ";
  for (int i = 1; i < res; ++i) cout << a[i] << " ";
  return 0;
}
