import sys
from math import ceil
# import bisect
# from collections import deque

Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()
 
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
INF = 10 ** 18
MOD = 10**9+7

for _ in range(int(ri())):
    n,k = Ri()
    ans = [0]*n
    for i in range(1,n,2):
        if k == 0:
            break
        ans[i] = 1
        k-=1
    if k > 0:
        for i in range(n):
            if ans[i] == 0:
                ans[i] = 1
                k-=1
            if k == 0:
                break
    suf = [0]*n
    suf[n-1] = n-1
    left = n
    for  i in range(n-1,-1,-1):
        suf[i] = left
        if ans[i] == 1:
            left = i
    # print(suf)
    tot = 0
    for i in range(n):
        if ans[i] == 1:
            tot+=(n-i)
        else:
            tot+=(n-suf[i])
    print(tot)
                
