#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define ull unsigned long long
#define vecint vector<int>
#define vecchar vector<char>
#define un_set unordered_set
#define un_map unordered_map
#define max_ele(v) *max_element(v.begin(), v.end())
#define min_ele(v) *min_element(v.begin(), v.end())
#define sort_asc(v) sort(v.begin(), v.end())
#define sort_dec(v) sort((v).begin(), (v).end(), greater<>())
#define Reverse(v) reverse(v.begin(), v.end())
#define pb push_back
#define ppb pop_back()
#define pf push_front
#define coutall(v)     \
    for (auto &it : v) \
    cout << it << " "
#define coutnewline(v) \
    for (auto &it : v) \
    cout << it << '\n'
#define cinall(v)      \
    for (auto &it : v) \
    cin >> it
#define yes cout << "YES\n"
#define no cout << "NO\n"

void solucionar()
{
    ll h, w, count = 0, k = 0;
    cin >> h >> w;
    ll min_ele = min(h, w);
    while (k < min_ele)
    {
        for (int i = 1; i < h - k; i++)
        {
            for (int j = 1; j < w - k; j++)
            {
                count++;
            }
        }
        k++;
    }
    cout << count + (h * w) << endl;
}

int main()
{
    int tests;
    cin >> tests;
    while (tests-- > 0)
    {
        solucionar();
    }
    return 0;
}