#include<iostream>
#include <cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
 int T; cin >> T;
  rep(i, T){
    ll n, m; cin >> n >> m;
    if(n>=m) cout << m/2 << endl;
    else{
      ll ko = min(n-1, m-n-1);
      ll ans = 3*ko + ko*(ko-1)/2;
      ans+=max(0LL, n-(m+1)/2);
      cout << ans << endl;
    }
  }
}