surinoel

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Example1
{
    class Example
    {

surinoel

#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

struct Tree {
	int age;
	Tree(int age = 0) {
		this->age = age;

surinoel

#include <cmath>
#include <string>
#include <iostream>

using namespace std;

int main(void) {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

surinoel

#include <iostream>
#include <algorithm>

using namespace std;

int gcd(int a, int b) {
	if (b == 0) {
		return a;
	}
	return gcd(b, a % b);

surinoel

#include <queue>
#include <tuple>
#include <cmath>
#include <cstring>
#include <iostream>

using namespace std;

int mat[50][50];
bool matopen[50][50][4];

surinoel

#include <deque>
#include <iostream>
#include <algorithm>

using namespace std;

int n, m, r;
int mat[300][300];

void rotate() {

surinoel

#include <cmath>
#include <string>
#include <cstring>
#include <iostream>

using namespace std;

int ans;
int s;
string ts;

surinoel

#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

int n, m;
bool visit[9];
vector<int> num;
vector<vector<int>> ans;

surinoel

#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

int n, m;
bool visit[9];
vector<int> num;
vector<vector<int>> ans;

surinoel

#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

int n, m;
bool visit[9];
vector<int> num;
vector<vector<int>> ans;