/*

同bzoj热身赛，二维前缀和，灌水留坑

*/

#include<iostream>

#include<cstdio>

#include<string>

#include<cstring>

#include<algorithm>

#include<cmath>

#include<queue>

using namespace std;

const int maxn = ,inf = ;

inline int read(){

    char ch=getchar();

    int f=,x=;

    while(!(ch>=''&&ch<='')){if(ch=='-')f=-;ch=getchar();};

    while(ch>=''&&ch<=''){x=x*+(ch-'');ch=getchar();};

    return x*f;

}

struct nd{

    int x;

    int y;

};

int p,n,m;

int ex[maxn],ey[maxn],xa,xb,ya,yb;

int flag,dis[][],vis[][];

short d[][],s[][];

int dx[] = {,,-,};

int dy[] = {,,,-};

bool emy[][];

inline bool jud(int x,int y,int t){

    if(x <  || y <  || x >= m || y >= n) return false;

    if(t == ) return true;

    t--;

    int tx=+x-y+t,ty=x+y+t,dx=+x-y-t,dy=x+y-t;

    if(ty>=n+m-) ty = n+m-;

    if(tx>=+m) tx = +m;

    int tot = s[ty][tx];

    if(dy>&&dx>-n) tot += s[dy-][dx-];

    if(dy>) tot -= s[dy-][tx];

    if(dx>-n) tot -= s[ty][dx-];

    if(tot) return false;

    else return true;

}

bool check(int t){

    if(!jud(xa,ya,t)) return false;

    flag++;

    for(int i = ;i <= n+;i++){

        for(int j = ;j <= m+;j++){

            dis[i][j] = inf;

        }

    }

    nd now,nxt;

    now.x = xa;

    now.y = ya;

    queue<nd> q;

    q.push(now);

    dis[ya][xa] = ;

    vis[ya][xa] = flag;

    while(!q.empty()){

        now = q.front();

        q.pop();

        //cout<<now.y<<" "<<now.x<<endl;

        for(int dr = ;dr < ;dr++){

            nxt.x = now.x + dx[dr];

            nxt.y = now.y + dy[dr];

            if(jud(nxt.x,nxt.y,t)&&vis[nxt.y][nxt.x] != flag){

                dis[nxt.y][nxt.x] = dis[now.y][now.x] + ;

                vis[nxt.y][nxt.x] = flag;

                q.push(nxt);

                if(nxt.y == yb && nxt.x == xb) return true;

            }

        }

    }

    return false;

}

int main(){

    freopen("escape.in","r",stdin);

    freopen("escape.out","w",stdout);

    cin>>p>>m>>n>>xa>>ya>>xb>>yb;

    for(int i = ;i <= p;i++){

        scanf("%d%d",&ex[i],&ey[i]);

        emy[ex[i]+ey[i]][+ex[i]-ey[i]] = true;

    }

    for(int i = ;i < n + m - ;i++){

        for(int j = -n;j < +m;j++){

            if(emy[i][j]) d[i][j] = d[i][j-] + ;

            else d[i][j] = d[i][j-];

        }

    }

    for(int i = ;i < n + m - ;i++){

        for(int j = -n;j < +m;j++){

            if(!i) s[i][j] = d[i][j];

            else s[i][j] = s[i-][j] + d[i][j];

        }

    }

    int l = ,r = n + m,mid,ans1,ans2;

    while(l <= r){

        mid = (l + r) >> ;

        if(check(mid)){

            ans1 = mid;

            ans2 = dis[yb][xb];

            l = mid + ;

        }else{

            r = mid - ;

        }

    }

    cout<<ans1<<" "<<ans2;

    return ;

}