B"Vanya decided to walk in the field of size n xe2 x80 x89 xc3 x97 xe2 x80 x89n cells. The field contains m apple trees, the i-th apple tree is at the cell with coordinates (xi, xe2 x80 x89yi). Vanya moves towards vector (dx, xe2 x80 x89dy). That means that if Vanya is now at the cell (x, xe2 x80 x89y), 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. The first line contains integers n, xe2 x80 x89m, xe2 x80 x89dx, xe2 x80 x89dy(1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89106, 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105, 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89dx, xe2 x80 x89dy xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n) -- the size of the field, the number of apple trees and the vector of Vanya's movement. Next m lines contain integers xi, xe2 x80 x89yi (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89xi, xe2 x80 x89yi xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89- xe2 x80 x891) -- the coordinates of apples. One cell may contain multiple apple trees. 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. In the first sample Vanya's path will look like: (1, xe2 x80 x893) xe2 x80 x89- xe2 x80 x89(3, xe2 x80 x891) xe2 x80 x89- xe2 x80 x89(0, xe2 x80 x894) xe2 x80 x89- xe2 x80 x89(2, xe2 x80 x892) xe2 x80 x89- xe2 x80 x89(4, xe2 x80 x890) xe2 x80 x89- xe2 x80 x89(1, xe2 x80 x893) In the second sample: (0, xe2 x80 x890) xe2 x80 x89- xe2 x80 x89(1, xe2 x80 x891) xe2 x80 x89- xe2 x80 x89(0, xe2 x80 x890)"...