#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);

using namespace std;

namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const double EPS = 1e-8, INF = 1e12, PI = acos(-1.0);
typedef complex<double> P;
namespace std{
	bool operator<(const P& a, const P& b){
		return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);
	}
}
inline double cross(const P& a, const P& b){ return imag(conj(a)*b); }
inline double dot(const P& a, const P& b){ return real(conj(a)*b); }
struct L : public vector<P>{
	L(const P &a, const P &b) {
		push_back(a); push_back(b);
	}
};
typedef vector<P> G;
inline int ccw(P a, P b, P c) {
	b -= a; c -= a;
	if(cross(b, c) >  EPS)   return +1;      // counter clockwise
	if(cross(b, c) < -EPS)   return -1;      // clockwise
	if(dot(b, c)   < -EPS)   return +2;      // c--a--b on line
	if(norm(b)+EPS <norm(c)) return -2;      // a--b--c on line
	return 0;                                   // c is between a and b (inclusive)
}
P projection(const L &l, const P &p) {
  double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);
  return l[0] + t*(l[0]-l[1]);
}
double distanceSP(const L &s, const P &p) {
  const P r = projection(s, p);
  if (ccw(s[0], s[1], r) == 0) return abs(r - p);
  return min(abs(s[0] - p), abs(s[1] - p));
}

int main(){
	cin.tie(0); cin.sync_with_stdio(0);
	int r, n;
	while(cin >> r >> n, r){
		G g;
		vi rs(n), vs(n);
		vector<double> limits;
		rep(i, n){
			int x, y; cin >> x >> y >> rs[i] >> vs[i];
			g.emplace_back(x, y);
			
			limits.pb((abs(g[i]) - r) / vs[i]);
		}
		
		vector<bool> flag(n);
		int ans = 0, time = 1;
		
		for(; ; time++){
			int nearest = -1;
			double dist = INF;
			rep(i, n) if(!flag[i]){
				if(time > limits[i]){
					flag[i] = 1;
					ans++;
					continue;
				}
				
				double d = max(0.0, abs(g[i]) - vs[i] * time);
				if(d < dist) dist = d, nearest = i;
				//dbg(time, i, d);
			}
			
			if(nearest < 0) break;
			const L seg(P(0, 0), g[nearest] * 3000.0);
			rep(i, n) if(!flag[i]){
				P vec = -g[i] * (vs[i] * time / abs(g[i]));
				//dbg(abs(g[i] + vec));
				if(distanceSP(seg, g[i] + vec) < rs[i] + EPS)
				flag[i] = 1;
			}
			assert(flag[nearest]);
		}
		//dbg(limits);
		//rep(i, n) if(!flag[i]) dbg(i);
		cout << ans << endl;
	}
	return 0;
}
