#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define all(x) (x).begin(),(x).end() #define rep(i,m,n) for(int i = m;i < n;++i) #define pb push_back #define fore(i,a) for(auto &i:a) #define rrep(i,m,n) for(int i = m;i >= n;--i) #define INF INT_MAX/2 using namespace std; using ll = long long; using R = double; using Data = pair>; const ll MOD = 1e9 + 7; const ll inf = 1LL << 50; struct edge { ll from; ll to; ll cost; }; int main() { int n, k; cin >> n >> k; if (n < k) { cout << "INF" << endl; } else { int ans = 0; rep(x, 0,8*n) { rep(y, x, x + k + 1){ int a = y & x; if (a == n) { ans++; } } } cout << ans << endl; } return 0; }