from collections import *
from itertools import *
from functools import *
from heapq import *
import math,sys
input = sys.stdin.readline

N,K = map(int,input().split())
A = [i+1 for i in range(N)]
S = list(accumulate([0]+A))
if S[-1]==K:
    print(0)
    exit()
SN = N*(N+1)//2
for i in range(N):
    
    if S[-1]-S[i]<K:
        break
    
    y = N
    x = i
    while y-x>1:
        mid = (y+x)//2
        
        if S[mid]-S[i]<SN-K:
            x = mid
        else:
            y = mid
    if S[y]-S[i]==SN-K:
        print(1)
        exit()
print(2)