#include<bits/stdc++.h>
using namespace std;
const long double eps=1e-9;
int curx;
struct circ
{
	int x,y,r,id,ty;
	long double eval()const
	{
		return y+ty*sqrt(max(0.0L,(1.0L*r*r-1.0L*(curx-x)*(curx-x))));
	}
	bool operator<(const circ &c)const
	{
		auto w=eval(),w2=c.eval();
		if(fabs(w-w2)<eps)return ty<c.ty;
		else return w<w2;
	}
};
int main()
{
	ios_base::sync_with_stdio(false);
	int n,q;
	cin>>n>>q;
	vector<tuple<int,int,int,int,int,circ>> events;
	for(int i=1;i<=n;i++)
	{
		int x,y,r;
		cin>>x>>y>>r;
		events.emplace_back(x-r,1,-y,1,i,(circ){x,y,r,i,-1});
		events.emplace_back(x+r,-1,-y,1,i,(circ){x,y,r,i,-1});
		events.emplace_back(x-r,1,-y,-1,i,(circ){x,y,r,i,1});
		events.emplace_back(x+r,-1,-y,-1,i,(circ){x,y,r,i,1});
	}
	for(int i=1;i<=q;i++)
	{
		int x,y,r;
		cin>>x>>y>>r;
		events.emplace_back(x-r,1,-y,1,i+n,(circ){x,y,r,i+n,-1});
		events.emplace_back(x+r,-1,-y,1,i+n,(circ){x,y,r,i+n,-1});
		events.emplace_back(x-r,1,-y,-1,i+n,(circ){x,y,r,i+n,1});
		events.emplace_back(x+r,-1,-y,-1,i+n,(circ){x,y,r,i+n,1});
	}
	vector<vector<int>> G(n+q+5);
	vector<int> pa(n+q+5);
	sort(events.begin(),events.end());
	set<circ> s;
	for(const auto &[pos,ty,ypos,ud,id,c]:events)
	{
		curx=pos;
//		if(ty==1)cerr<<"add circle ";
//		else cerr<<"del circle ";
//		cerr<<pos<<' '<<ypos<<' '<<ud<<' '<<id<<' '<<c.x<<' '<<c.y<<' '<<c.r<<' '<<c.ty<<endl;
		if(ty==1 and c.ty==1)
		{
			auto it=s.upper_bound(c);
			if(it==s.end())pa[id]=0;
			else
			{
				if(it->ty==-1)pa[id]=pa[it->id];
				else pa[id]=it->id;
			}
		}
		if(ty==1)s.insert(c);
		else s.erase(c);
	}
	for(int i=1;i<=n+q;i++)
	{
//		cerr<<"pa "<<i<<' '<<pa[i]<<endl;
		G[pa[i]].push_back(i);
	}
	vector<vector<int>> dp(n+q+5,vector<int>(2));
	vector<int> ans(q+5);
	function<void(int)> dfs=[&](int u)
	{
		for(auto v:G[u])
		{
			dfs(v);
		}
		dp[u][1]=1;
		for(auto v:G[u])
		{
			dp[u][0]+=dp[v][1];
			dp[u][1]+=dp[v][0];
		}
		dp[u][1]=max(dp[u][0],dp[u][1]);
		if(u>n)
		{
			ans[u-n]=dp[u][1];
			dp[u][0]=dp[u][1]=0;
			for(auto v:G[u])
			{
				dp[u][0]+=dp[v][0];
				dp[u][1]+=dp[v][1];
			}
		}
	};
	for(int i=1;i<=n+q;i++)
	{
		if(not pa[i])
		{
			dfs(i);
		}
	}
	for(int i=1;i<=q;i++)
	{
		cout<<ans[i]<<"\n";
	}
	return 0;
}