#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<int,int> P;
typedef pair<int,P> PP;
const ll MOD=998244353;
const double PI=acos(-1);


int main(){
    ll N,K;
    cin>>N>>K;

    ll l=0,r=0;
    ll sum=0;

    if(K==N*(N+1)/2){
        cout<<0<<endl;
        return 0;
    }

    ll tot=N*(N+1)/2;


    while(l<=N){

        while(r<N && (tot-sum)>K){
            sum+=r;
            r++;
        }

        //(tot-sum)<=K || r==N

        if((tot-sum)==K){
            cout<<1<<endl;
            return 0;
        }
        //r==Nのときは何もしない

        //(tot-sum)<K

        sum-=l;
        l++;

    }

    cout<<2<<endl;
    return 0;

}