Klee‘s SUPER DUPER LARGE Array!!!

Klee’s SUPER DUPER LARGE Array!!!

Problem

Klee has an array a of length n containing integers $[k,k+1,...,k+n-1]$ in that order. Klee wants to choose an index $i$ $(1\le i\le n)$ such that $x=|a_1+a_2+\cdots +a_i-a_{i+1}-\cdots -a_n|$ is minimized. Note that for an arbitrary integer $z$, $|z|$ represents the absolute value of $z$.

Output the minimum possible value of $x$.

Input

The first line contains $t$ $(1\le t\le 10^4)$ — the number of test cases.

Each test case contains two integers $n$ and $k$ $(2\le n,k\le 10^9)$ — the length of the array and the starting element of the array.

Output

For each test case, output the minimum value of $x$ on a new line.

Example

Input

4
2 2
7 2
5 3
1000000000 1000000000

Output

1
5
1
347369930

Note

In the first sample, $a=[2,3]$. When $i=1$ is chosen, $x=|2-3|=1$. It can be shown this is the minimum possible value of $x$.

In the third sample, $a=[3,4,5,6,7]$. When $i=3$ is chosen, $x=|3+4+5-6-7|=1$. It can be shown this is the minimum possible value of $x$.

Code

// #include <iostream>
// #include <algorithm>
// #include <cstring>
// #include <sstream>//整型转字符串
// #include <stack>//栈
// #include <deque>//堆/优先队列
// #include <queue>//队列
// #include <map>//映射
// #include <unordered_map>//哈希表
// #include <vector>//容器，存数组的数，表数组的长度
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int main()
{
    ll t;
    cin>>t;

    while(t--)
    {
        ll n,k;
        cin>>n>>k;
        ll sum=(n+k)*(n+k-1)/2+k*(k-1)/2;
        
        ll ans=sqrt(sum);
        cout<<min(abs(sum-ans*(ans-1)),abs(sum-ans*(ans+1)))<<endl;
    }
    
    return 0;
}