#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;
using ld = long double;

//#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

const int nmax = 1e6 + 5;
int atr[nmax];

void fill(int k) {
   if(k == 0) return;
   int p = (1 << 32 - __builtin_clz(2 * k - 1));
   //cerr << p << ' ' << 2 * k - 1 << '\n';
   //assert(p > 2 * k - 1 && p / 2 <= 2 * k - 1);

   for(int i = k; 2 * k - 1 + 2 * i - 1 >= p; i--) {
      atr[i] = (p - (2 * i - 1) + 1) / 2;
   }
   
   fill(atr[k] - 1);
}

signed main() {
   cin.tie(0) -> sync_with_stdio(0);
   string s;
   int n;
   cin >> s >> n;
   fill(n);
   cout << n << '\n';
   for(int i = 1; i <= n; i++) cout << atr[i] << ' ';
   cout << '\n';
}

/**
      Istenem! Nu poate fi real.
-- Surse verificate
*/