import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int root(int[] uf, int u) {
  return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u]));
}
bool connect(int[] uf, int u, int v) {
  u = uf.root(u);
  v = uf.root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


long brute(int N, long M) {
  alias Edge = Tuple!(long, "c", int, "u", int, "v");
  Edge[] es;
  foreach (u; 0 .. N) foreach (v; u + 1 .. N) {
    es ~= Edge(((u + 1) + (v + 1)) % M, u, v);
  }
  es.sort;
  auto uf = new int[N];
  uf[] = -1;
  long ans;
  foreach (e; es) {
    if (uf.connect(e.u, e.v)) {
      ans += e.c;
    }
  }
  return ans;
}

long solve(long N, long M) {
  chmin(N, M);
  long ans;
  if ((N - 1) + N < M) {
    // (1, 2), ..., (1, N)
    ans += ((1 + 2) + (1 + N)) * (N - 1) / 2;
  } else {
    // (1, 2), ..., (1, M-r)
    // (M-r, r), ..., (floor((M-1)/2), ceil((M+1)/2))
    const r = min(N, M - 1);
    ans += ((1 + 2) + (1 + (M - r))) * (M - r - 1) / 2;
    ans += ((M - 1) / 2) - (M - r);
    if (M % 2 == 0) {
      ans += 1;
    }
    if (M <= N) {
      ans += 1;
    }
  }
  return ans;
}

void main() {
  debug {{
    enum lim = 10;
    foreach (m; 1 .. lim + 1) foreach (n; 1 .. lim + 1) {
      const brt = brute(n, m);
      const slv = solve(n, m);
      assert(brt == slv, format("%s %s: %s %s", n, m, brt, slv));
    }
  }}
  
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const N = readLong;
        const M = readLong;
        
        const ans = solve(N, M);
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}