#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

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

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b>>1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;


//////////////////////////
int main() {
	ll N, a, b;
	cin >> N >> a >> b;

	vector<ll> x(N + 1), y(N + 1);
	repn(i, N) cin >> x[i] >> y[i];

	ll d = abs(x[a] - x[b]) + abs(y[a] - y[b]);

	map<ll, set<pair<ll,ll>>> wa, sa;

	repn(i, N) {
		if (i == a) { continue; }
		wa[x[i] + y[i]].insert({ x[i],i });
		sa[x[i] - y[i]].insert({ x[i],i });
	}

	queue<ll> q;
	q.push(a);
	
	vector<bool> acc(N + 1, 0);
	acc[a] = 1;
	
	while (!q.empty()) {
		ll c = q.front();
		q.pop();

		//cout << c << endl << flush;
		
		auto itr = wa[x[c] + y[c] + d].lower_bound({x[c],0});
		auto itr2 = wa[x[c] + y[c] + d].lower_bound({ x[c] + d + 1,0 });
		for (auto i = itr; i != itr2;i++) {
			ll m = (*i).first;
			ll k = (*i).second;
			sa[x[k] - y[k]].erase({m,k});
			q.push(k);
			acc[k] = 1;
		}
		wa[x[c] + y[c] + d].erase(itr, itr2);

		itr = wa[x[c] + y[c] - d].lower_bound({ x[c] - d,0 });
		itr2 = wa[x[c] + y[c] - d].lower_bound({ x[c] + 1,0 });
		for (auto i = itr; i != itr2; ++i) {
			ll m = (*i).first;
			ll k = (*i).second;
			sa[x[k] - y[k]].erase({ m,k });
			q.push(k);
			acc[k] = 1;
		}
		wa[x[c] + y[c] - d].erase(itr, itr2);

		itr = sa[x[c] - y[c] + d].lower_bound({ x[c],0 });
		itr2 = sa[x[c] - y[c] + d].lower_bound({ x[c] + d + 1,0 });
		for (auto i = itr; i != itr2; ++i) {
			ll m = (*i).first;
			ll k = (*i).second;
			wa[x[k] + y[k]].erase({ m,k });
			q.push(k);
			acc[k] = 1;
		}
		sa[x[c] - y[c] + d].erase(itr, itr2);

		itr = sa[x[c] - y[c] - d].lower_bound({ x[c] - d,0 });
		itr2 = sa[x[c] - y[c] - d].lower_bound({ x[c] + 1,0 });
		for (auto i = itr; i != itr2; ++i) {
			ll m = (*i).first;
			ll k = (*i).second;
			wa[x[k] + y[k]].erase({ m,k });
			q.push(k);
			acc[k] = 1;
		}
		sa[x[c] - y[c] - d].erase(itr, itr2);
	}

	map<ll, vector<ll>> wav, sav;
	repn(i, N) {
		wav[x[i] + y[i]].push_back(x[i]);
		sav[x[i] - y[i]].push_back(x[i]);
	}

	for (auto &p : wav) {
		sort(p.second.begin(), p.second.end());
	}
	for (auto &p : sav) {
		sort(p.second.begin(), p.second.end());
	}

	ll ans = 0;
	repn(c, N) {
		if (acc[c] == 0) { continue; }
		auto itr = lower_bound(wav[x[c] + y[c] + d].begin(), wav[x[c] + y[c] + d].end(), x[c]);
		auto itr2 = lower_bound(wav[x[c] + y[c] + d].begin(), wav[x[c] + y[c] + d].end(), x[c] + d + 1);
		ans += distance(itr, itr2);
		//cout << ans << " ";

		itr = lower_bound(wav[x[c] + y[c] - d].begin(), wav[x[c] + y[c] - d].end(), x[c] - d);
		itr2 = lower_bound(wav[x[c] + y[c] - d].begin(), wav[x[c] + y[c] - d].end(), x[c] + 1);
		ans += distance(itr, itr2);
		//cout << ans << " ";

		itr = lower_bound(sav[x[c] - y[c] + d].begin(), sav[x[c] - y[c] + d].end(), x[c] + 1);
		itr2 = lower_bound(sav[x[c] - y[c] + d].begin(), sav[x[c] - y[c] + d].end(), x[c] + d);
		ans += distance(itr, itr2);
		//cout << ans << " ";

		itr = lower_bound(sav[x[c] - y[c] - d].begin(), sav[x[c] - y[c] - d].end(), x[c] - d + 1);
		itr2 = lower_bound(sav[x[c] - y[c] - d].begin(), sav[x[c] - y[c] - d].end(), x[c]);
		ans += distance(itr, itr2);

		//cout << ans << endl;
	}

	cout << ans/2 << endl;


}


Measured memory_bytes: 76032