## Goldmine

## POI VIII Stage 3 Problem 5## GoldmineByteman, one of the most deserving employee of The Goldmine of Byteland, is
about to retire by the end of the year. The Goldmine management would like to
reward him in acknowledgment of his conscientious
work. As a reward Byteman
may receive a small lot - a rectangular piece of the mine's area with sides of
length ## TaskWrite a program which: - reads from the text file KOP.IN the location of gold nuggets,
- computes the maximal value of a lot (i.e. the maximal number of gold nuggets on the lot of given size),
- writes the result in the text file KOP.OUT.
## InputIn the first line of the text file KOP.IN there are two positive integerss and w separated by a single space, (1<=s,w<=10 000);
they denote the lengths of lot's sides - parallel to the OX-axe and OY-axe
respectively. There is one positive integer n written in the second line, (1<=n<=15 000).
It denotes the number of nuggets in the area of the Goldmine. In the following n
lines there are written the coordinates of the nuggets. Each of these lines
consists of two integers x and y, (-30 000<=x,y<=30 000),
separated by a single space and denoting the x and the y coordinate
of a nugget respectively.
## OutputThe text file KOP.OUT should contain exactly one integer equal to the value of the most valuable lot of a given size.## Sample Input1 2 12 0 0 1 1 2 2 3 3 4 5 5 5 4 2 1 4 0 5 5 0 2 3 3 2 ## Sample Output4SubmitStatistics |