#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;
int n,k;

int dp[500005];
int main(){
//    freopen("test.in","r",stdin);
    scanf("%d%d",&n,&k);
    rep(i,0,k) if((i & (n - 1)) == 0) dp[i] = 1;
    int answer = dp[k];
//    printf("%d\n",answer.val());
    int m = 1,u = 0;
    while(m * (m + 1) / 2 <= k){
        if(n + 1 == m) break;
        u += m;
        rep(i,u,k) dp[i] ^= dp[i - m];
        per(i,k,u) dp[i] = dp[i - m];

        int d = n + 1 - m;
        per(i,k,u){
            if(i + d <= k) dp[i + d] ^= dp[i];
        }

        answer ^= dp[k];
        m++;
    }
    printf("%d\n",answer);
	return 0;
}