#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <iterator>
#include <functional>
#include <complex>
#include <queue>
#include <stack>
#include <cmath>
#include <cassert>
#include <cstring>
using namespace std;
typedef long long LL;
typedef complex<double> CMP;

class PouringWater {
public:
	int nbits(int n) {
		int cnt = 0;
		while(n) {
			if(n&1) ++cnt;
			n>>=1;
		}
		return cnt;
	}
	int getMinBottles(int N, int K) 
	{
		for(int i=0;;++i)
			if( nbits(N+i) <= K )
				return i;
	}
};

// BEGIN CUT HERE
#include <ctime>
double start_time;string timer() { ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }

template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
int verify_case(const int &Expected, const int &Received) { if (Expected == Received) cerr << "PASSED" << timer() << endl; else { cerr << "FAILED" << timer() << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } return 0;}

template<int N> struct Case_ { Case_(){start_time=clock();} };
char Test_(...);
int Test_(Case_<0>) {
	int N = 3; 
	int K = 1; 
	int RetVal = 1; 
	return verify_case(RetVal, PouringWater().getMinBottles(N, K)); }
int Test_(Case_<1>) {
	int N = 13; 
	int K = 2; 
	int RetVal = 3; 
	return verify_case(RetVal, PouringWater().getMinBottles(N, K)); }
int Test_(Case_<2>) {
	int N = 1000000; 
	int K = 5; 
	int RetVal = 15808; 
	return verify_case(RetVal, PouringWater().getMinBottles(N, K)); }

template<int N> void Run_() { cerr << "Test Case #" << N << "..." << flush; Test_(Case_<N>()); Run_<sizeof(Test_(Case_<N+1>()))==1 ? -1 : N+1>(); }
template<>      void Run_<-1>() {}
int main() { Run_<0>(); }
// END CUT HERE

