7adff00aa0270e229f9ca9211ca905e9eef98264fdeebdc59c28f06d32ae6940
// https://sio2.mimuw.edu.pl/c/oi34-1/p/kol/
#include <bits/stdc++.h>
// #define GARY_DBG
#define GARY_LIB
constexpr int sizik = 1000 * 1001;
constexpr int LX = -1000, RX = 1000, LY = -1000, RY = 1000;
#define ar std::array
typedef std::vector<std::vector<int>> _kra;
namespace brut1 {
void solve() {
// plansza
for (int y = RY; y >= LY; y--) {
for (int x = LX; x <= RX; x++) {
if (x <= 0) {
std::cout << "1 ";
} else {
std::cout << "2 ";
}
}
std::cout << '\n';
}
// instrukcje
std::cout << "2\n";
std::cout << "1 1 1 1 1 E\n";
std::cout << "2 2 2 2 2 W\n";
}
} // namespace brut1
namespace brut2 {
inline int 🌹️(int 🌹️🌹️) {
return 🌹️🌹️ < 0 ? -🌹️🌹️ : 🌹️🌹️;
}
void solve();
} // namespace brut2
namespace brut3 {
void solve() {
// plansza
for (int y = RY; y >= LY; y--) {
for (int x = LX; x <= RX; x++) {
if (y == 0) {
if (x < 0) {
int m = ((x % 3) + 3) % 3;
if (m == 1)
std::cout << "2 ";
else if (m == 0)
std::cout << "1 ";
else if (m == 2)
std::cout << "1 ";
} else {
int m = ((x % 3) + 3) % 3;
if (m == 1)
std::cout << "2 ";
else if (m == 0)
std::cout << "2 ";
else if (m == 2)
std::cout << "1 ";
}
} else if (y > 0) {
int m = ((y % 3) + 3) % 3;
if (m == 0) {
std::cout << "2 ";
} else if (m == 1) {
std::cout << "1 ";
} else if (m == 2) {
std::cout << "1 ";
}
} else if (y < 0) {
int m = ((y % 3) + 3) % 3;
if (m == 0) {
std::cout << "1 ";
} else if (m == 1) {
std::cout << "2 ";
} else if (m == 2) {
std::cout << "2 ";
}
}
}
std::cout << '\n';
}
// instrukcje
std::cout << "14\n";
std::cout << "1 2 1 1 1 S\n";
std::cout << "2 2 2 2 2 N\n";
std::cout << "1 1 1 2 1 S\n";
std::cout << "1 1 2 2 1 E\n";
std::cout << "2 2 2 1 2 N\n";
std::cout << "1 1 1 1 1 S\n";
std::cout << "1 2 1 2 1 N\n";
std::cout << "2 1 2 2 2 N\n";
std::cout << "1 1 1 2 2 E\n";
std::cout << "2 1 1 2 2 W\n";
std::cout << "2 1 1 2 1 E\n";
std::cout << "2 1 2 1 2 S\n";
std::cout << "2 1 2 2 1 W\n";
std::cout << "1 1 2 2 2 W\n";
}
} // namespace brut3
void solve() {
int k, t;
std::cin >> k >> t;
if (t == 1) {
return brut1::solve();
}
if (k == 3) {
return brut2::solve();
}
return brut3::solve();
}
int32_t main() {
#ifndef GARY_DBG
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
std::cout.tie(0);
#endif
int t = 1;
// std::cin >> t;
for (; t > 0; t--) {
solve();
}
return 0;
}
// k = 3
void brut2::solve() {
// plansza
for (int y = LY; y <= RY; y++) {
for (int x = LX; x <= RX; x++) {
int maxi = std::max(🌹️(x), 🌹️(y));
int v = (maxi + 3 - 1) % 3;
if (v == 0) v = 3;
std::cout << v << " ";
}
std::cout << '\n';
}
// instrukcje
std::cout << 243 << '\n';
for (int moj = 1; moj <= 3; moj++) {
for (int N = 1; N <= 3; N++) {
for (int E = 1; E <= 3; E++) {
for (int S = 1; S <= 3; S++) {
for (int W = 1; W <= 3; W++) {
char e;
if (moj == 1) {
if (N == 3)
e = 'N';
else if (E == 3)
e = 'E';
else if (S == 3)
e = 'S';
else if (W == 3)
e = 'W';
else if (N == 1)
e = 'N';
else if (E == 1)
e = 'E';
else if (S == 1)
e = 'S';
else if (W == 1)
e = 'W';
else
e = 'N';
} else if (moj == 2) {
if (N == 1)
e = 'N';
else if (E == 1)
e = 'E';
else if (S == 1)
e = 'S';
else if (W == 1)
e = 'W';
else if (N == 2)
e = 'N';
else if (E == 2)
e = 'E';
else if (S == 2)
e = 'S';
else if (W == 2)
e = 'W';
else
e = 'N';
} else if (moj == 3) {
if (N == 2)
e = 'N';
else if (E == 2)
e = 'E';
else if (S == 2)
e = 'S';
else if (W == 2)
e = 'W';
else if (N == 3)
e = 'N';
else if (E == 3)
e = 'E';
else if (S == 3)
e = 'S';
else if (W == 3)
e = 'W';
else
e = 'N';
}
std::cout << moj << " " << N << " " << E << " " << S << " " << W << " " << e << '\n';
}
}
}
}
}
}