#include <bits/stdc++.h>
using namespace std;
map<int, int> ans;
vector<int> ans1;
int main() {
  int s, k;
  cin >> s >> k;
  ans[0] = 1;
  int cur = 1;
  for (int i = 1; cur <= s; i++) {
    int t = 0;
    for (int l = i - 1, tt = 0; l >= 0 && tt < k; tt++, l--) t += ans[l];
    ans[i] = t;
    cur = t;
  }
  for (map<int, int>::reverse_iterator it = ans.rbegin(); it != ans.rend();
       it++) {
    if (it->second && s >= it->second && s) {
      ans1.push_back(it->second);
      s -= it->second;
    }
  }
  ans1.push_back(0);
  cout << ans1.size() << endl;
  sort(ans1.begin(), ans1.end());
  for (int i = 0; i < ans1.size(); i++) cout << ans1[i] << " ";
  return 0;
}
