#include using namespace std; #if __has_include() #include using namespace atcoder; #endif using ll = long long; using ld = long double; using ull = long long; #define all(s) (s).begin(),(s).end() #define rep2(i, m, n) for (int i = (m); i < (n); ++i) #define rep(i, n) rep2(i, 0, n) #define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i) #define drep(i, n) drep2(i, n, 0) #define rever(vec) reverse(vec.begin(), vec.end()) #define sor(vec) sort(vec.begin(), vec.end()) #define fi first #define se second #define P pair #define REP(i, n) for (int i = 0; i < (n); ++i) const ll mod = 998244353; //const ll mod = 1000000007; const ll inf = 2000000000000000000ll; static const long double pi = 3.141592653589793; templatevoid vcin(vector &n){for(int i=0;i>n[i];} templatevoid vcout(vector &n){for(int i=0;i void chmax(T& t,const U& u){if(t void chmin(T& t,const U& u){if(t>u) t=u;} template void ifmin(T t,T u){if(t>u){cout<<-1< void ifmax(T t,T u){if(t>u){cout<<-1<auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector(arg,x);else return vector(arg,make_vector(x,args...));} ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; } void gbjsmzmfuuvdf(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); cout<< fixed << setprecision(20); } void solve(vector> &ans){ for(int i=1;i> ans){ for(int i=2;i<=ans.size();i++){ for(int x=0;x+i>n>>m; if(n==1){ if(m){ cout<<1<=7){ bool t=true; while(m--){ ll a,b,c; cin>>a>>b>>c; a--; b--; if(c==0){ t=false; } } if(t){ cout<<1< x(m),y(m),z(m); for(int i=0;i>x[i]>>y[i]>>z[i]; x[i]--; y[i]--; } ll count=0; for(int i=0;i<(1<<(2*n-1));i++){ vector> ans(n,vector(n)); ll k=i; for(int j=0;j