2253.cpp

/*
 * AOJ 2253
 * give up
 */
#include <iostream>
#include <utility>
#include <cmath>

using namespace std;
typedef pair<int, int> pos;

const int MAX_N = 31;

pair xs[MAX_N];

int dist(pos a, pos b) {
	int c = abs( max(a.first, a.second) - min(b.first, b.second) ),
		d = abs( min(a.first, a.second) - max(b.first, b.second) );
	return max(c, d);
}

int main() {
	int ts, xnum; cin >> ts >> xnum;
	pos p; 

	for (int i = 0; i < xnum; ++i)
		cin >> xs[i].first >> xs[i].second;

	cin >> p.first >> p.second;

	int cango = ts;

	return 0;
}