#include <bits/stdc++.h>

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = std::int64_t;
using P = std::tuple<int,int>;

constexpr ll B = 135000, INF = std::numeric_limits<ll>::max() / 2;
int N, K;
ll dp[17][270000];

ll add(ll x, ll y){
    if(x < INF && y < INF){
        return x + y;
    }

    return INF;
}

ll rec(int i, int d){
    if(i == 17){
        d -= B;

        if(0 <= d && d <= K){
            return 1;
        }else if(d <= - (1 << 17) + K){
            return INF;
        }

        return 0;
    }

    if(dp[i][d] != -1){
        return dp[i][d];
    }

    ll res;

    if(N >> i & 1){
        res = rec(i + 1, d);
    }else{
        res = add(add(rec(i + 1, d + (1 << i)), rec(i + 1, d - (1 << i))), rec(i + 1, d));
    }

    return dp[i][d] = res;
}

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N >> K;

    memset(dp, -1, sizeof(dp));

    ll res = rec(0, B);

    if(res < INF){
        std::cout << res << std::endl;
    }else{
        std::cout << "INF" << std::endl;
    }
}