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