#include #define MOD 1000000007 #define INF (1<<30) #define INFL (1<<62) #define pe(str) return cout<<(str)<=0;i--) #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(b);i>=(a);i--) #define bw(a,b,c) (((a)<=(b))&&((b)<=(c))) #define hello cout<<"hello"<>n using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair pii; typedef complex point; template void dump(InputIterator first,InputIterator last,char delim=' '){ for(InputIterator it=first;it!=last;it++){ if(it!=first)cout< void swp(T &a,T &b){ T t=a; a=b; b=t; } int m[101][101]; int c=0; int a,b; void f(int i,int j){ if(m[i][j]==1)return; if(!(bw(0,i,a-1)&&bw(0,j,b-1)))return; c++; m[i][j]=1; // dbdb(i<<" "<>a>>b>>c; re(i,a) re(j,b) m[i][j]=0; f(c/a,c%a); pe("NO"); return 0; }