#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,K;

void solve() {
    cin>>N>>K;
    
    if (N<K) {
        cout << "INF" << endl;
        return;
    }
    
    bitset<30> b(N);
    vector<int> vec; // 使えるbit目
    REP(j,10) if (!b[j]) vec.push_back(j);
    int ans = 0;
    REP(i,pow(3,vec.size())) {
        int x = N;
        int y = N;
        REP(j,vec.size()) {
            int m = i / (int)pow(3,j) % 3;
            if (m==2) y += 1<<vec[j];
            if (m==1) x += 1<<vec[j];
        }
        if (x > y) continue;
        if (y - x > K) continue;
        ans++;
    }
    
    cout << ans << endl;
}