#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <string>
#include <set>
using namespace std;
typedef long long ll;
ll t,n,m,ans,num,p,k;
ll s[1000007];
int main()
{
    scanf("%lld",&t);
    s[1]=0;
    s[0]=0;
    for(int i=1;i<=1000000;i++)
    {
        s[i+1]=i+s[i];
    }
    while(t--)
    {
        scanf("%lld %lld",&n,&m);
        if(n-m*2<0)
        {
            cout<<s[n]<<endl;
        }
        else
        printf("%lld\n",s[n]-s[n-m*2]);
    }
}