#include <bits/stdc++.h>
using namespace std;
long long int fib[3000000];
long long int n;
vector<int> v;
int main() {
  int k, i, j;
  scanf("%I64d %d", &n, &k);
  k = min(k, 1000000);
  for (i = 0; i <= k; i++) fib[i] = 0;
  fib[k] = 1;
  for (i = k + 1;; i++) {
    fib[i] = 0;
    for (j = i - 1; j >= i - k; j--) fib[i] += fib[j];
    if (fib[i] > 1000000000) break;
  }
  for (; i >= 0; i--) {
    if (n >= fib[i]) {
      n -= fib[i];
      v.push_back(fib[i]);
    }
    if (n == 0) break;
  }
  printf("%d\n", max((int)v.size(), 2));
  if (v.size() == 1)
    printf("0 %d", v[0]);
  else
    for (i = 0; i < v.size(); i++) printf("%d ", v[i]);
  printf("\n");
  return 0;
}
