1021

#include <iostream>#include <iterator>#include <cstring>#include <algorithm>using namespace std;int board[2][100][100], visit[2][100][100], blocknum[2], block[2][10001], index, x[10000], y[10000], dir[4][2] = {0, 1, 1, 0, 0, -1, -1, 0}, W, H, n;void dfs(const int i, const int j, const int k){visit[i][j][k] = 1;x[index] = j;y[index] = k;++index;for(int acc = 0, _x, _y; acc < 4; ++acc){_x = j + dir[acc][0];_y = k + dir[acc][1];if(0 <= _x && _x < W && 0 <= _y && _y < H && board[i][_x][_y] && !visit[i][_x][_y]){dfs(i, _x, _y);}}}int main(){istream_iterator<int> ip(cin);int t = *ip;while(t--){W = *(++ip);H = *(++ip);n = *(++ip);memset(board, 0, sizeof(board));memset(visit, 0, sizeof(visit));memset(block, 0, sizeof(block));blocknum[0] = blocknum[1] = 0;for(int i = 0; i < 2; ++i){for(int j = 1; j <= n; ++j){int x = *(++ip), y = *(++ip);board[i][x][y] = 1;}}for(int i = 0; i < 2; ++i){for(int j = 0; j < W; ++j){for(int k = 0; k < H; ++k){if(board[i][j][k] && !visit[i][j][k]){++blocknum[i];index = 0;dfs(i, j, k);for(int p = 0; p < index; ++p){for(int q = p + 1; q < index; ++q){block[i][blocknum[i]] += (x[q] - x[p]) * (x[q] - x[p]) + (y[q] - y[p]) * (y[q] - y[p]);}}}}}}if(blocknum[0] != blocknum[1]){cout << "NO" << endl;}else{sort(block[0] + 1, block[0] + 1 + blocknum[0]);sort(block[1] + 1, block[1] + 1 + blocknum[1]);int i;for(i = 1; i <= blocknum[0] && block[0][i] == block[1][i]; ++i);if(i <= blocknum[0]){cout << "NO" << endl;}else{cout << "YES" << endl;}}}return 0;}