#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int t,n,m,k,count;
int b[30];
scanf("%d",&t);
set<int> s;
set<int> :: iterator it,jt;
while(t--)
{
int max=-1;
scanf("%d",&n);
scanf("%d",&m);
for(int i=0;i<n;i++)
{
b[i]=i+1;
}
while(next_permutation(b,b+n))
{count=0;
for(int i=0;i<n;i++)
{
s.insert(b[i]);
it=s.find(b[i]);
jt=it;
if(it==s.begin())
{
count+=(*it);
}
else
{
--it;
count+=(*jt)-(*it);
}
it=jt;
it++;
if(it==s.end())
{
count+=(n+1)-(*jt);
}
else
{
count+=(*it)-(*jt);
}
}
if(count>max&&count<m)
{
max=count;
}
}
cout<<max<<endl;
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgdCxuLG0sayxjb3VudDsKCWludCBiWzMwXTsKCXNjYW5mKCIlZCIsJnQpOwoJc2V0PGludD4gczsKCXNldDxpbnQ+IDo6IGl0ZXJhdG9yIGl0LGp0OwoJd2hpbGUodC0tKQoJewoJCWludCBtYXg9LTE7CgkJc2NhbmYoIiVkIiwmbik7CgkJc2NhbmYoIiVkIiwmbSk7CgkJZm9yKGludCBpPTA7aTxuO2krKykKCQl7CgkJCWJbaV09aSsxOwoJCX0KCQl3aGlsZShuZXh0X3Blcm11dGF0aW9uKGIsYituKSkKCQl7Y291bnQ9MDsKCQlmb3IoaW50IGk9MDtpPG47aSsrKQoJCXsKCQkJCgkJCXMuaW5zZXJ0KGJbaV0pOwoJCQlpdD1zLmZpbmQoYltpXSk7CgkJCWp0PWl0OwoJCQlpZihpdD09cy5iZWdpbigpKQoJCQl7CgkJCQljb3VudCs9KCppdCk7CgkJCX0KCQkJZWxzZQoJCQl7CgkJCQktLWl0OwoJCQkJY291bnQrPSgqanQpLSgqaXQpOwoJCQl9CgkJCWl0PWp0OwoJCQlpdCsrOwoJCQlpZihpdD09cy5lbmQoKSkKCQkJewoJCQkJY291bnQrPShuKzEpLSgqanQpOwoJCQl9CgkJCWVsc2UKCQkJewoJCQkJY291bnQrPSgqaXQpLSgqanQpOwoJCQl9CgkJfQoJCWlmKGNvdW50Pm1heCYmY291bnQ8bSkKCQl7CgkJCW1heD1jb3VudDsKCQl9CgkJfQoJCWNvdXQ8PG1heDw8ZW5kbDsKCQkKCX0KCXJldHVybiAwOwp9