Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) ＜一维表示二维＞

#include <bits/stdc++.h>  
using namespace std;  
  
void solve() {  
    int n, m;  
    cin >> n >> m;  
    vector<int> arr(n * m);  
    for (int i = 0; i < n * m; i++) {  
        cin >> arr[i];  
    }  
  
    if (n * m == 1) {  
        cout << -1 << endl;  
        return;  
    }  
  
    reverse(arr.begin(), arr.end());  
    if (arr.size() % 2 == 1) {  
        swap(arr[0], arr[arr.size() / 2]);  
    }  
  
    for (int i = 0; i < n * m; i++) {  
        cout << arr[i] << " ";  
        if ((i + 1) % m == 0) cout << endl;  
    }  
}  
  
int main() {  
    cin.tie(0), cout.tie(0);  
    ios::sync_with_stdio(0);  
  
    int t;  
    cin >> t;  
    while (t--) {  
        solve();  
    }  
  
    return 0;  
}