#include <bits/stdc++.h>
using namespace std;

template<class T> ostream& operator << (ostream& os, const vector<T>& vec) {
    if(vec.empty()) return os;
    os << vec[0];
    for(auto it = vec.begin(); ++it != vec.end(); ) os << ' ' << *it;
    return os;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, K;
    cin >> N >> K;
    if(N == 0){
        cout << (K ? "INF" : "1") << '\n';
        return 0;
    }
    if(K == 0){
        cout << 1 << '\n';
        return 0;
    }
    int ms = __lg(N) + 1, val = 1 << ms + 1;
    for(int i = 0; i <= ms; i++){
        if(N >> i & 1) continue;
        val -= 1 << i;
    }
    if(val <= K){
        cout << "INF" << '\n';
        return 0;
    }
    vector<int> b;
    int cur = N ^ ((1 << 30) - 1);
    while((cur & -cur) <= 64 * K){
        b.emplace_back(cur & -cur);
        cur ^= cur & -cur;
    }
    vector<int> S(1 << b.size(), N);
    int r = 1 << b.size(), ans = 0;
    for(int i = 0; i < r; i++){
        for(int j = 0; j < b.size(); j++){
            if(i >> j & 1) S[i] += b[j];
        }
    }
    for(int i = 0; i < r; i++){
        for(int j = i; j < r && S[j] <= S[i] + K; j++){
            ans += (S[i] & S[j]) == N;
        }
    }
    cout << ans << '\n';
}