[2018-4-27]BNUZ套题比赛div2 B【补题】

Gleb ordered pizza home. When the courier delivered the pizza, he was very upset, because several pieces of sausage lay on the crust, and he does not really like the crust.

The pizza is a circle of radius r and center at the origin. Pizza consists of the main part — circle of radius r - d with center at the origin, and crust around the main part of the width d. Pieces of sausage are also circles. The radius of the i -th piece of the sausage is r_i, and the center is given as a pair (x_i, y_i).

Gleb asks you to help determine the number of pieces of sausage caught on the crust. A piece of sausage got on the crust, if it completely lies on the crust.

Input

First string contains two integer numbers r and d (0 ≤ d < r ≤ 500) — the radius of pizza and the width of crust.

Next line contains one integer number n — the number of pieces of sausage (1 ≤ n ≤ 10⁵).

Each of next n lines contains three integer numbers x_i, y_i and r_i ( - 500 ≤ x_i, y_i ≤ 500, 0 ≤ r_i ≤ 500), where x_i and y_i are coordinates of the center of i-th peace of sausage, r_i — radius of i-th peace of sausage.

Output

Output the number of pieces of sausage that lay on the crust.

Examples

Input

8 4
7
7 8 1
-7 3 2
0 2 1
0 -2 2
-3 -3 1
0 6 2
5 3 1

Output

2

Input

10 8
4
0 0 9
0 0 10
1 0 1
1 0 2

Output

0

Note

Below is a picture explaining the first example. Circles of green color denote pieces of sausage lying on the crust.

啥也不说了，把内径当成d了，先抽自己两巴掌

Pia!(ｏ ‵-′)ノ”(ノ﹏<。) 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>

using namespace std;


int main (){
	long long  r,d;
	cin >> r >> d;
	int t;
	cin >> t;
	int ans = 0;
	long long  x,y,k;
	long double  r1,r2;
	while(t--){
		
		cin >> x >> y >> k;
		r1 = sqrt(x * x + y * y) - k;
		r2 = sqrt(x * x + y * y) + k;	
		if(r1 >= r - d && r2 <= r){
			ans++;
		}	
//		cout << ans << endl;
	}
	cout << ans << endl;
	return 0;
}