#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
namespace my{
#define done(...) return pp(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define FO(n) for(ll ij=n;ij--;)
#define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fo(i,...) FO##__VA_OPT__(R)(i __VA_OPT__(,__VA_ARGS__))
#define single_testcase void solve();}int main(){my::io();my::solve();}namespace my{
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
constexpr auto range(bool s,auto...a){array<ll,3>r{0,0,1};ll I=0;((r[I++]=a),...);if(!s&&I==1)swap(r[0],r[1]);r[0]-=s;return r;}
constexpr char newline=10;
constexpr char space=32;
constexpr auto zz(auto x){return x<0?-x:x;}

void lin(auto&...a){(cin>>...>>a);}
template<char c=space>void pp(const auto&...a){ll n=sizeof...(a);((cout<<a<<string(--n>0,c)),...);cout<<newline;}

ll bsl(const auto&f,ll o,ll x){while(zz(o-x)>1)(f((o+x)/2)?o:x)=(o+x)/2;return o;}

single_testcase
void solve(){
  LL(R,K);++R;
  if((R-1)*R==K*2)done(0);
  if(K==0)done(1);

  fo(l,1,R){
    ll r=bsl([&](ll r){
      return(r-l)*(l+r-1)<=K*2;
    },l,R+2);
    if(r==R+1)continue;
    if((l==1||r==R)&&(r-l)*(l+r-1)==K*2)done(1);
  }

  fo(l,1,R){
    ll r=bsl([&](ll r){
      return(r-l)*(l+r-1)<=(R-1)*R-K*2;
    },l,R+2);
    if(r==R+1)continue;
    if((r-l)*(l+r-1)==(R-1)*R-K*2)done(1);
  }

  pp(2);
}}