UFO Shooting Down Operation

In 40XX, the Earth was invaded by aliens! Already most of the Earth has been dominated by aliens, leaving Tsuruga Castle Fortress as the only remaining defense base. Suppression units are approaching the Tsuruga Castle Fortress one after another.

But hope remains. The ultimate defense force weapon, the ultra-long-range penetrating laser cannon, has been completed. The downside is that it takes a certain distance to reach its power, and enemies that are too close can just pass through. Enemies who have invaded the area where power does not come out have no choice but to do something with other forces. The Defense Forces staff must know the number to deal with the invading UFOs, but it is unlikely to be counted well because there are too many enemies. So the staff ordered you to have a program that would output the number of UFOs that weren't shot down by the laser. Create a program by the time the battle begins and help protect the Tsuruga Castle Fortress.

Enemy UFOs just rush straight toward the base of the laser cannon (the UFOs are treated to slip through each other and do not collide). The laser cannon begins firing at the center of the nearest UFO one minute after the initial state, and then continues firing the laser every minute under the same conditions. The laser penetrates, and the UFO beyond it can be shot down with the laser just scratching it. However, this laser has a range where it is not powerful, and it is meaningless to aim a UFO that has fallen into that range, so it is designed not to aim. How many UFOs invaded the area where the power of the laser did not come out when it was shot down as much as possible?

Create a program that inputs the radius R of the range where the power of the laser does not come out and the information of the invading UFO, and outputs how many UFOs are invading without being shot down. The information on the incoming UFO consists of the number of UFOs N, the initial coordinates of each UFO (x0, y0), the radius r of each UFO, and the speed v of each UFO.

The origin of the coordinates (0, 0) is the position of the laser cannon. The distance between the laser cannon and the UFO is given by the distance from the origin to the center of the UFO, and UFOs with this distance less than or equal to R are within the range where the power of the laser does not come out. Consider that there are no cases where there are multiple targets to be aimed at at the same time. All calculations are considered on a plane and all inputs are given as integers.

Input

A sequence of multiple datasets is given as input. The end of the input is indicated by two lines of zeros. Each dataset is given in the following format:

R N x01 y01 r1 v1 x02 y02 r2 v2 :: x0N y0N rN vN

The first line gives the radius R (1 ≤ R ≤ 500) and the number of UFOs N (1 ≤ N ≤ 100) within the range of laser power. The following N lines give the i-th UFO information x0i, y0i (-100 ≤ x0i, y0i ≤ 1000), ri, vi (1 ≤ ri, vi ≤ 500).

The number of datasets does not exceed 50.

Output

For each input dataset, it prints the number of UFOs that have invaded the area where the laser power does not come out on one line.

Example

Input

100 5 101 101 5 5 110 110 2 3 -112 -100 9 11 -208 160 82 90 -110 108 10 2 10 11 15 0 5 1 25 0 5 1 35 0 5 1 45 0 5 1 55 0 5 1 65 0 5 1 75 0 5 1 85 0 5 1 95 0 5 1 -20 0 5 20 -30 0 500 5 0 0

Output

1 1

inputFormat

outputFormat

output the number of UFOs that weren't shot down by the laser. Create a program by the time the battle begins and help protect the Tsuruga Castle Fortress.

Enemy UFOs just rush straight toward the base of the laser cannon (the UFOs are treated to slip through each other and do not collide). The laser cannon begins firing at the center of the nearest UFO one minute after the initial state, and then continues firing the laser every minute under the same conditions. The laser penetrates, and the UFO beyond it can be shot down with the laser just scratching it. However, this laser has a range where it is not powerful, and it is meaningless to aim a UFO that has fallen into that range, so it is designed not to aim. How many UFOs invaded the area where the power of the laser did not come out when it was shot down as much as possible?

Create a program that inputs the radius R of the range where the power of the laser does not come out and the information of the invading UFO, and outputs how many UFOs are invading without being shot down. The information on the incoming UFO consists of the number of UFOs N, the initial coordinates of each UFO (x0, y0), the radius r of each UFO, and the speed v of each UFO.

The origin of the coordinates (0, 0) is the position of the laser cannon. The distance between the laser cannon and the UFO is given by the distance from the origin to the center of the UFO, and UFOs with this distance less than or equal to R are within the range where the power of the laser does not come out. Consider that there are no cases where there are multiple targets to be aimed at at the same time. All calculations are considered on a plane and all inputs are given as integers.

Input

A sequence of multiple datasets is given as input. The end of the input is indicated by two lines of zeros. Each dataset is given in the following format:

R N x01 y01 r1 v1 x02 y02 r2 v2 :: x0N y0N rN vN

The first line gives the radius R (1 ≤ R ≤ 500) and the number of UFOs N (1 ≤ N ≤ 100) within the range of laser power. The following N lines give the i-th UFO information x0i, y0i (-100 ≤ x0i, y0i ≤ 1000), ri, vi (1 ≤ ri, vi ≤ 500).

The number of datasets does not exceed 50.

Output

For each input dataset, it prints the number of UFOs that have invaded the area where the laser power does not come out on one line.

Example

Input

100 5 101 101 5 5 110 110 2 3 -112 -100 9 11 -208 160 82 90 -110 108 10 2 10 11 15 0 5 1 25 0 5 1 35 0 5 1 45 0 5 1 55 0 5 1 65 0 5 1 75 0 5 1 85 0 5 1 95 0 5 1 -20 0 5 20 -30 0 500 5 0 0

Output

1 1

样例

100 5
101 101 5 5
110 110 2 3
-112 -100 9 11
-208 160 82 90
-110 108 10 2
10 11
15 0 5 1
25 0 5 1
35 0 5 1
45 0 5 1
55 0 5 1
65 0 5 1
75 0 5 1
85 0 5 1
95 0 5 1
-20 0 5 20
-30 0 500 5
0 0

1
1

</p>