#include<iostream>
//#include<windows.h>
#include<stdio.h>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<iomanip>
#include<stack>
#include<queue>
#include<string>
#include<cstring>
#include<cstdlib>
#include<ctime>
#include<bitset>

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector< ii > vii;
typedef vector< pair < ii, int > > viii;
typedef vector< vector < ii > > vvii;
typedef pair < pair < int, int >, int >  iii;
typedef pair < pair < int, int >, pair < int, int > > iiii;
typedef unsigned long long ull;
typedef long long ll;
typedef unsigned long long ull;
typedef vector< ll > vll;
typedef long double ld;
typedef map < int, int > MAPA;

#define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define st first
#define nd second
#define rep(i,n) for(int i=0; i<(n); ++i)
#define rall(c) (c).rbegin(), (c).rend()
#define FOR(i, a, b)    for (int (i)=(a); (i)<(b); (i)++)
#define FOR2(i, a, b)    for (int (i)=(a); (i)>=(b); (i)--)

template<typename T> inline void setmin(T &x, T y) { if (y < x) x = y; }
template<typename T> inline void setmax(T &x, T y) { if (y > x) x = y; }
template<typename T> inline T gcd(T a, T b) { while (b)swap(a %= b, b); return a; }

const int MAX = 2e6 + 7;
const int T = 1 << 20;
const int INF = 1e9 + 7;
const ll BIG_INF = 1e18 + 5;

ld e = 2.7182818284590452353602874713526624;
ld PI = acos(-1);
ld eps = 1e-19;

ll n, m, k, t;
ll current_gold;

int tab[20][20];
int w_plecaku[20][20];
int odw[20][20];
int akt_zakr;
int farmerzy;

int losuj(int a, int b) {
	return a + rand() % (b - a + 1);
}

void ustaw_poczatkowy_stan() {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> tab[i][j];
			//if( i || j )tab[i][j] = pow(2, losuj(0, 9));
			w_plecaku[i][j] = 0;
			odw[i][j] = 0;
		}
	}
	farmerzy = 0;
	current_gold = 200;
	akt_zakr = 1;
}

bool jest_jeszcze() {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (w_plecaku[i][j] || tab[i][j]) {
				return 1;
			}
		}
	}
	return 0;
}

bool nie_ma_do() {
	for (int i = 0; i <= akt_zakr; i++) {
		for (int j = 0; j < n; j++) {
			if (w_plecaku[i][j] || tab[i][j]) {
				return 0;
			}
		}
	}
	return 1;
}

void wykonaj_ruch() {
	bool byl = 0;
	if ( odw[0][0] ) {
		byl = 1;
	}
	for (int i = 1; i <= akt_zakr; i++) {
		if (!odw[i - 1][0] && odw[i][0]) {
			cout << "M " << i << ' ' << 0 << ' ' << i - 1 << ' ' << 0 << '\n';
			odw[i - 1][0] = 1;
			odw[i][0] = 0;
			w_plecaku[i - 1][0] = w_plecaku[i][0];
			w_plecaku[i][0] = 0;
		}
	}
	for (int i = 1; i <= akt_zakr; i++) {
		for (int j = 1; j < n; j++) {
			if (j == n - 1 && i != akt_zakr) {
				continue;
			}
			if (!odw[i][j - 1] && odw[i][j]) {
				cout << "M " << i << ' ' << j << ' ' << i << ' ' << j - 1 << '\n';
				odw[i][j - 1] = 1;
				odw[i][j] = 0;
				w_plecaku[i][j - 1] = w_plecaku[i][j];
				w_plecaku[i][j] = 0;
			}
		}
	}
	for (int i = akt_zakr - 1; i >= 0; i--) {
		if (!odw[i + 1][n - 1] && odw[i][n - 1]) {
			cout << "M " << i << ' ' << n-1 << ' ' << i + 1 << ' ' << n-1 << '\n';
			odw[i + 1][n - 1] = 1;
			odw[i][n - 1] = 0;
			w_plecaku[i + 1][n - 1] = w_plecaku[i][n - 1];
			w_plecaku[i][n - 1] = 0;
		}
	}
	for (int j = n - 2; j > 0; j--) {
		if (odw[0][j] && !odw[0][j + 1]) {
			cout << "M " << 0 << ' ' << j << ' ' << 0 << ' ' << j + 1 << '\n';
			odw[0][j] = 0;
			odw[0][j + 1] = 1;
			w_plecaku[0][j + 1] = w_plecaku[0][j];
			w_plecaku[0][j] = 0;
		}
	}

	if (byl) {
		cout << "M " << 0 << ' ' << 0 << ' ' << 0 << ' ' << 1 << '\n';;
		odw[0][1] = 1;
		odw[0][0] = 0;
	}
}

void kup_farmera() {
	farmerzy++;
	current_gold -= 100;
	odw[0][1] = 1;
	cout << "R FARMER\n" << "M 0 0 0 1\n";
}

void zakoncz_ture() {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (odw[i][j]) {
				if (i == 0 && j == 0) {
					current_gold += w_plecaku[0][0];
					w_plecaku[0][0] = 0;
				}
				else {
					int zmiana = min(10, tab[i][j]);
					w_plecaku[i][j] += zmiana;
					tab[i][j] -= zmiana;
				}
			}
		}
	}
	cout << "=\n";
}
void jazda_pokaz() {
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			cout << odw[i][j] << ' ';
		}
		cout << '\t';
		for (int j = 0; j < n; ++j) {
			cout << tab[i][j] << ' ';
		}
		cout << '\t';
		for (int j = 0; j < n; ++j) {
			cout << w_plecaku[i][j] << ' ';
		}
		cout << '\n';
	}
}
void zakoncz_gre() {
	cout << "===\n";
}

int main() {
	boost;
	srand(time(0));
	cin >> t >> k;

	while (t--) {
		cin >> n;
		int ile_tur = 0;
		ustaw_poczatkowy_stan();
		while (jest_jeszcze()) {
			ile_tur++;
			wykonaj_ruch();
			if (!odw[0][1] && !odw[0][0] && farmerzy < (2 * n - 1) && current_gold >= 100) {
				kup_farmera();
			}
			zakoncz_ture();
			if (nie_ma_do()) {
				akt_zakr++;
			}
			//jazda_pokaz();
		}
		zakoncz_gre();
		//cout << ile_tur << endl;
	}
}