1692E. Binary Deque

原题链接

E. Binary Deque

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Slavic has an array of length nn consisting only of zeroes and ones. In one operation, he removes either the first or the last element of the array.

What is the minimum number of operations Slavic has to perform such that the total sum of the array is equal to ss after performing all the operations? In case the sum ss can't be obtained after any amount of operations, you should output -1.

Input

The first line contains a single integer tt (1≤t≤1041≤t≤104) — the number of test cases.

The first line of each test case contains two integers nn and ss (1≤n,s≤2⋅1051≤n,s≤2⋅105