#include #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define all(x) (x).begin(),(x).end() #define fix(x) fixed << setprecision(x) #define eb emplace_back constexpr char nl='\n'; using namespace std; using ll = long long; using ld = long double; using vl = vector; using vvl = vector>; using vs = vector; using pl = pair; template inline bool chmin(T& a, const T& b) {bool compare = a > b; if (a > b) a = b; return compare;} template inline bool chmax(T& a, const T& b) {bool compare = a < b; if (a < b) a = b; return compare;} templateusing rp_queue=priority_queue,greater>; void fast_io(){cin.tie(nullptr);ios_base::sync_with_stdio(false);} template T gcd(T a, T b) {if (b == 0)return a; else return gcd(b, a % b);} template inline T lcm(T a, T b) {return a /gcd(a, b)*b;} const ll INF = 1LL << 60; const ld PI = acos(-1); void solve(){ int N,M;cin>>N>>M; assert(1<=N&&N<=100000); assert(1<=M&&M<=100000); while(M--){ int p,q;cin>>p>>q; assert(1<=p<=N); assert(1<=q<=1000000000); } } int main(){ fast_io(); int num_tc = 1; //cin >> num_tc; rep(tc,num_tc){ //cout << "Case #" << tc+1 << ": " ;// << endl; solve(); } }