#include <bits/stdc++.h>
using namespace std;
const int oo = 1e9;
const long long OO = 1ll << 62;
map<long long, bool> use;
int s, k;
vector<long long> K, res;
int main() {
  scanf("%d%d", &s, &k);
  K.resize(51);
  K[0] = 0;
  K[1] = 1;
  for (int i = 2; i <= 50; ++i) {
    K[i] = 0;
    for (int j = i - 1; j >= i - k && j >= 0; --j) K[i] += K[j];
  }
  K.resize(unique(K.begin(), K.end()) - K.begin());
  res.push_back(0);
  for (int i = 50; i > 0; --i) {
    if (K[i] > s) continue;
    s -= K[i];
    res.push_back(K[i]);
  }
  printf("%d\n", (int)res.size());
  for (int i = 0; i < (int)res.size(); ++i) printf("%lld ", res[i]);
  return 0;
}
