#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const int N = 1e6 + 10, INF = 0x3f3f3f3f, MOD = 1E9 + 7;

void solve() {
    int n, m;
    cin >> n >> m;
    int t = min(n, m);
    cout << 1ll * t * t << endl;
}
int main(int argc, char* argv[]) {
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}