#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


#ifndef LIBRA_OTHER_INT128_H_
#define LIBRA_OTHER_INT128_H_

#include <stdio.h>
#include <iostream>

constexpr unsigned __int128 toUInt128(const char *s) {
  unsigned __int128 x = 0;
  for (; *s; ++s) x = x * 10 + (*s - '0');
  return x;
}
constexpr __int128 toInt128(const char *s) {
  if (*s == '-') return -toInt128(s + 1);
  __int128 x = 0;
  for (; *s; ++s) x = x * 10 + (*s - '0');
  return x;
}
unsigned __int128 inUInt128() {
  static char buf[41];
  scanf("%s", buf);
  return toUInt128(buf);
}
__int128 inInt128() {
  static char buf[41];
  scanf("%s", buf);
  return toInt128(buf);
}

void out(unsigned __int128 x) {
  static char buf[41];
  int len = 0;
  do { buf[len++] = '0' + static_cast<int>(x % 10); } while (x /= 10);
  for (int i = len; --i >= 0; ) putchar(buf[i]);
}
void out(__int128 x) {
  if (x < 0) {
    putchar('-');
    out(-static_cast<unsigned __int128>(x));
  } else {
    out(static_cast<unsigned __int128>(x));
  }
}
std::ostream &operator<<(std::ostream &os, unsigned __int128 x) {
  static char buf[41];
  int len = 0;
  do { buf[len++] = '0' + static_cast<int>(x % 10); } while (x /= 10);
  for (int i = len; --i >= 0; ) os << buf[i];
  return os;
}
std::ostream &operator<<(std::ostream &os, __int128 x) {
  if (x < 0) {
    os << '-' << -static_cast<unsigned __int128>(x);
  } else {
    os << static_cast<unsigned __int128>(x);
  }
  return os;
}

#endif  // LIBRA_OTHER_INT128_H_


using U = unsigned __int128;
struct Solver {
  int K, N;
  vector<U> dp;
  Solver(int K_) : K(K_), N(-1), dp{} {
    dp.push_back(1);
    for (int n = 1; ; ++n) {
      dp.push_back(0);
      dp[n] += dp[n - 1];
      if (n >= 2*K+1) dp[n] += dp[n - (2*K+1)];
      if (dp[n - 1] > dp[n]) {
// cerr<<"dp["<<n-1<<"] = "<<dp[n-1]<<", dp["<<n<<"] = "<<dp[n]<<endl;
        N = n;
        break;
      }
    }
  }
  string encode(U x) const {
    string s;
    for (int n = N; n > 0; ) {
      if (x < dp[n - 1]) {
        s += '1';
        n -= 1;
      } else {
        s += string(2*K+1, '0');
        x -= dp[n - 1];
        n -= (2*K+1);
      }
    }
    return s;
  }
  U decode(const string &s) const {
    vector<int> is;
    for (int i = 0; i < N; ++i) if (s[i] == '1') is.push_back(i);
    const int isLen = is.size();
    int pos = 0;
    U x = 0;
    for (int n = 0; n < N; ) {
      if (pos < isLen && is[pos] <= n + K) {
        ++pos;
        n += 1;
      } else {
        x += dp[N - n - 1];
        n += (2*K+1);
      }
    }
    return x;
  }
};


#include <string>

//you may define some global variables, but it does not work if you try to transfer any information from function pigeon_num or function send to function receive through these variables.
//you had better not use the same global variables in function send and in function receive.

/*
Taskid:         The index of the subtask. If it is subtask 2, then Taskid=2.
k:              The time threshold. Suppose the i-th pigeon taking off is the p_i-th one to land. It is guaranteed that abs(i-p_i)<=k.
return value:   The number of pigeons Little E will use.
*/
int pigeon_num(int Taskid, int k){
	//you may do some initialization for SEND function here
	
  const Solver solver(k);
  return solver.N;
  
	return 5;//change this into your code
}

/*
Taskid:         The index of the subtask. If it is subtask 2, then Taskid=2.
n:              The number of pigeons Little E will use. This equals the return value of function pigeon_num.
k:              The time threshold. Suppose the i-th pigeon taking off is the p_i-th one to land. It is guaranteed that abs(i-p_i)<=k.
msg:            The content of the message.
return value:	The order of the pigeons taking off. The length of this string must be n. return_value[i]='0' means the (i+1)-th pigeon taking off is black. return_value[i]='1' means the (i+1)-th pigeon taking off is white.
*/
std::string send(int Taskid, int n, int k, __uint128_t msg){
  const Solver solver(k);
  return solver.encode(msg);
  
	return "10101";//change this into your code
}

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

class Init{
public:
	Init(){
		//you may do some initialization for RECEIVE function here
	}
};

/*
Taskid:         The index of the subtask. If it is subtask 2, then Taskid=2.
k:              The time threshold. Suppose the i-th pigeon taking off is the p_i-th one to land. It is guaranteed that abs(i-p_i)<=k.
msg:			The order of the pigeons landing. Its length is equal to n. msg[i] denotes the color of the (i+1)-th pigeon watched landing by Little F. '0' means black and '1' means white.
return value:	The content of the message. It should be correct.
*/
__uint128_t receive(int Taskid, int k, const std::string &msg){
	const static Init init;
  
  const Solver solver(k);
  return solver.decode(msg);
  
	{//change this into your code
		__uint128_t hi = 5281683694948011861llu;
		__uint128_t lo = 3195384480471073102llu;
		return hi<<64|lo; //this value equals 97429867398990605044182047185430790478
	}
}