#include <bits/stdc++.h>
using namespace std;

int main()
{
	int64_t n, k;
	cin >> n >> k;
	
	vector<int64_t> s(n + 1);
	s[1] = 1;
	for(int64_t i = 2; i <= n; i++) s[i] = s[i - 1] + i;
	
	if(binary_search(s.begin(), s.end(), k))
	{
		cout << 1 << endl;
		return 0;
	}
	
	const int64_t smax = n * (n + 1) / 2;
	int64_t r_sum = 0;
	for(int64_t i = n; i >= 2; i--)
	{
		r_sum += i;
		s.pop_back();
		if(binary_search(s.begin(), s.end(), k - r_sum))
		{
			cout << 1 << endl;
			return 0;
		}
	}
	cout << 2 << endl;
	return 0;
}