#include <bits/stdc++.h>
using namespace std;
int a[100000], t, s, i, len, j, cnt, res[100000], m, n, k, sum;
int main() {
  scanf("%d %d", &s, &k);
  a[0] = 1;
  for (i = 1; a[i - 1] <= s; i++) {
    j = i - 1;
    t = k;
    while (j >= 0 && t--) a[i] += a[j--];
  }
  t = i - 1;
  while (s > 0 && t >= 0) {
    if (a[t] <= s) {
      res[m++] = a[t];
      s -= a[t];
    }
    t--;
  }
  if (m == 1)
    printf("2\n0 ");
  else
    printf("%d\n", m);
  for (i = 0; i < m; i++) printf("%d ", res[i]);
  printf("\n");
  return 0;
}
