Codeforces Round #280 (Div. 2) E. Vanya and Field 思维题

E. Vanya and Field

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Vanya decided to walk in the field of size n × n cells. The field contains m apple trees, the i-th apple tree is at the cell with coordinates (x_i, y_i). Vanya moves towards vector (dx, dy). That means that if Vanya is now at the cell (x, y), then in a second he will be at cell . The following condition is satisfied for the vector: , where is the largest integer that divides both a and b. Vanya ends his path when he reaches the square he has already visited.

Vanya wonders, from what square of the field he should start his path to see as many apple trees as possible.

Input

The first line contains integers n, m, dx, dy(1 ≤ n ≤ 10⁶, 1 ≤ m ≤ 10⁵, 1 ≤ dx, dy ≤ n) — the size of the field, the number of apple trees and the vector of Vanya's movement. Next m lines contain integers x_i, y_i (0 ≤ x_i, y_i ≤ n - 1) — the coordinates of apples. One cell may contain multiple apple trees.

Output

Print two space-separated numbers — the coordinates of the cell from which you should start your path. If there are several answers you are allowed to print any of them.

Sample test(s)

Input

5 5 2 3
0 0
1 2
1 3
2 4
3 1

Output

1 3

Input

2 3 1 1
0 0
0 1
1 1

Output

0 0

Note

In the first sample Vanya's path will look like: (1, 3) - (3, 1) - (0, 4) - (2, 2) - (4, 0) - (1, 3)

In the second sample: (0, 0) - (1, 1) - (0, 0)

#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
ll kiss[];
ll cnt[];
int main()
{
    sspeed;
    int n,m,dx,dy;
    int x=,y=;
    cin>>n>>m>>dx>>dy;
    for(int i=;i<n;i++)
    {
        x+=dx;
        x=x%n;
        y+=dy;
        y=y%n;
        kiss[x]=y;
    }
    int flag=,maxn=;
    for(int i=;i<m;i++)
    {
        cin>>x>>y;
        y=(n+y-kiss[x])%n;
        cnt[y]++;
        if(maxn<cnt[y])
        {
            maxn=cnt[y];
            flag=y;
        }
    }
    cout<<""<<" "<<flag<<endl;
    return ;
}