#include <iostream> #include <string> #include <vector> #include <algorithm> #include <set> #include <utility> using namespace std; using i64 = long long; #define rep(i,n) for(int i=0; i<(int)(n); i++) int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); i64 N, K; cin >> N >> K; vector<i64> S(N+1); rep(i,N) S[i+1] = S[i] + (i+1); set<i64> Q(S.begin(), S.end()); int ans = 2; rep(i,N+1) if(Q.count(K - (S[N] - S[i]))) ans = 1; cout << ans << '\n'; return 0; }