#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) {cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl;}

using namespace std;

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}
bool operator<(const TRI&_)const{return(fi==_.fi)?((se==_.se)?(th<_.th):(se<_.se)):(fi<_.fi);}};
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;

const int MAX_N = 100005;

unordered_map<int, set<P> > x, y;
unordered_map<int, vector<int> > tx, ty;
ll p[MAX_N], q[MAX_N], d;
ll ans;

void kesu(int id){
    ans += lower_bound(all(tx[p[id] - d]), q[id] + d) - lower_bound(all(tx[p[id] - d]), q[id] - d);
    ans += upper_bound(all(tx[p[id] + d]), q[id] + d) - upper_bound(all(tx[p[id] + d]), q[id] - d);
    ans += upper_bound(all(ty[q[id] - d]), p[id] + d) - upper_bound(all(ty[q[id] - d]), p[id] - d);
    ans += lower_bound(all(ty[q[id] + d]), p[id] + d) - lower_bound(all(ty[q[id] + d]), p[id] - d);
    x[p[id]].erase({q[id], id});
    y[q[id]].erase({p[id], id});
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, a, b;
    cin >> n >> a >> b;
    --a, --b;
    rep(i,n){
        ll c, d;
        cin >> c >> d;
        p[i] = c - d, q[i] = c + d;
        x[c - d].insert({c + d, i});
        y[c + d].insert({c - d, i});
        tx[c - d].pb(c + d), ty[c + d].pb(c - d);
    }
    each(it,tx){
        sort(all(it.se));
    }
    each(it,ty){
        sort(all(it.se));
    }
    d = max(abs(p[a] - p[b]), abs(q[a] - q[b]));
    queue<int> que;
    que.push(a), que.push(b);
    kesu(a), kesu(b);
    while(!que.empty()){
        int t = que.front();
        que.pop();
        stack<int> check;
        for(auto it = x[p[t]-d].lower_bound({q[t]-d,-1}); it != x[p[t]-d].upper_bound({q[t]+d,n}); ++it){
            que.push(it->se), check.push(it->se);
        }
        while(!check.empty()){
            kesu(check.top());
            check.pop();
        }
        for(auto it = x[p[t]+d].lower_bound({q[t]-d,-1}); it != x[p[t]+d].upper_bound({q[t]+d,n}); ++it){
            que.push(it->se), check.push(it->se);
        }
        while(!check.empty()){
            kesu(check.top());
            check.pop();
        }
        for(auto it = y[q[t]-d].lower_bound({p[t]-d,-1}); it != y[q[t]-d].upper_bound({p[t]+d,n}); ++it){
            que.push(it->se), check.push(it->se);
        }
        while(!check.empty()){
            kesu(check.top());
            check.pop();
        }
        for(auto it = y[q[t]+d].lower_bound({p[t]-d,-1}); it != y[q[t]+d].upper_bound({p[t]+d,n}); ++it){
            que.push(it->se), check.push(it->se);
        }
        while(!check.empty()){
            kesu(check.top());
            check.pop();
        }
    }
    cout << ans / 2 << "\n";
    return 0;
}


Measured memory_bytes: 61972