#include using namespace std; #define int long long #define vvi vector> #define vec vector #define pq priority_queue #define all(v) (v).begin(), (v).end() #define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end()); #define rep(i, n) for (int (i) = (0); (i) < (n); ++(i)) #define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i)) #define dbg(x) cerr << #x << ": " << x << endl; #define dbg2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<(value) << endl; #define line() cerr << "---------------" << endl; const int dx[] = {1, -1, 0, 0}; const int dy[] = {0, 0, -1, 1}; const double PI = 3.14159265358979323846; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b void print1(T begin, T end) { while (begin != end) { cout << (*begin) << " "; *begin++; } cout << endl; } template void print2(T Array, int height, int width) { for (int i = 0; i < height; i++) { for (int j = 0; j < width; j++) { cout << " " << Array[i][j]; } cout << endl; } } void print() { std::cerr << endl; } template void print(Head&& head, Tail&&... tail) { std::cerr << head << " "; print(std::forward(tail)...); } template void Add(T &a, const T &b, const T &mod=1000000007) { int val = ((a % mod) + (b % mod)) % mod; if (val < 0) { val += mod; } a = val; } template auto vectors(X x, T a) { return vector(x, a); } template auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector(x, cont); } // ------------------------------------------------------------------------------------------ int n, k; int ans = 0; bool check(int x, int y) { return (x <= y) and (y - x <= k) and ((x & y) == n); } /* void dfs(int turn, int x, int y) { if (y - x > k) return; if ((1ll << turn) > (1ll << n)) { if (check(x, y)) { // dbg2(x, y) ans++; } return; } if ((1ll << turn) & n) { if (y - x <= k) dfs(turn+1, x | (1ll << turn), y | (1ll << turn)); } else { if (y - x <= k) dfs(turn+1, x, y); if (y - x <= k) dfs(turn+1, x | (1ll << turn), y); if (y - x <= k) dfs(turn+1, x, y | (1ll << turn)); } } */ set cand; void dfs(int turn, int val) { if (turn > 18) { if ((val & n) == n) cand.insert(val); return; } dfs(turn+1, val); dfs(turn+1, val | (1ll << turn)); } signed main() { cin >> n >> k; if (n < k) { puts("INF"); return 0; } dfs(0, 0); int lim = 0; while (1) { if ((1ll << lim) > n) { break; } lim++; } vector v(cand.size()); int cnt = 0; for (int val : cand) { v[cnt++] = val; // if (val < (1< k) break; if (check(v[i], v[j])) { ans2++; if (v1 == -2) { v1 = -1; continue; } if (v1 == -1) { v1 = v[j] - v[i]; continue; } if (v1 >= 0 and v2 == -1) { v2 = v[j] - v[i]; continue; } } } } cout << ans2 << endl; return 0; }