The moles appear out of holes occupying the $n^2$ integer points $(x, y)$ satisfying $0 \le x,y < n$ in a two-dimensional coordinate system. At each time step, some moles will appear and then disappear again before the next time step. After the moles appear but before they disappear, you are able to move your hammer in a straight line to any position $(x_2, y_2)$ that is at distance at most $d$ from your current position $(x_1, y_1)$. For simplicity, we assume that you can only move your hammer to a point having integer coordinates. A mole is whacked if the center of the hole it appears out of is located on the line between $(x_1, y_1)$ and $(x_2, y_2)$ (including the two endpoints). Every mole whacked earns you a point. When the game starts, before the first time step, you are able to place your hammer anywhere you see fit.
The input consists of several test cases. Each test case starts with a line containing three integers $n,d$ and $m$, where $n$ and $d$ are as described above, and $m$ is the total number of moles that will appear ($1 \leq n \leq 20$, $1 \leq d \le 5$, and $1 \leq m \leq 1\, 000$). Then follow $m$ lines, each containing three integers $x, y$ and $t$ giving the position and time of the appearance of a mole ($0 \leq x, y < n$ and $1 \leq t \leq 10$). No two moles will appear at the same place at the same time.
The input is ended with a test case where $n = d = m = 0$. This case should not be processed.
For each test case output a single line containing a single integer, the maximum possible score achievable.
|Sample Input 1||Sample Output 1|
4 2 6 0 0 1 3 1 3 0 1 2 0 2 2 1 0 2 2 0 2 5 4 3 0 0 1 1 2 1 2 4 1 0 0 0