#include<bits/stdc++.h>
#define abs(a) ((a)<0?-(a):(a))
#define sqr(a) ((a)*(a))
inline int read()
{
	int s=0;
	char c; 
	while((c=getchar())<'0' || c>'9');
	do{s=s*10+c-'0';}while((c=getchar())>='0' && c<='9');
	return s;
}         
inline long double readf()
{
	long double s=0,e=1;
	char c;
	bool f=0;
	while((c=getchar())<'0'||c>'9') if(c=='-') f=1;
	do{s=s*10+c-'0';}while((c=getchar())>='0' && c<='9');
	if(c=='.')
	{
		c=getchar(); 
		do
		{
			s=s+(c-'0')*(e*=0.1);
		}
		while((c=getchar())>='0' && c<='9'); 
	}
	return f?-s:s;                  
}
const int N=68000;
const double eps=1e-9,ea=3;
typedef long long lint;
int n,m,typ[N],et,ans[N];
long double rx[N],ry[N],rz[N],a,b,aa[N],bb[N],cc[N],dd[N];
long double dc(double k)
{
	long double x=(k-b)/a,y=(k+b)/a;
	while(y-x>eps)
	{
		long double mid=(x+y)*0.5;
		if(a*mid-b*sin(mid)<k) 
			x=mid; 
		else 
			y=mid;
	}
	return (long double)x;
}
namespace OSU
{
	lint pr[N],fc[N],ep[N];
	int ps,tot,etot;
	bool np[N];
	void init()
	{
		int i,j;
		np[1]=1;
		for(i=2;i<=n;i++)
		{
			if(!np[i]) 
				pr[++ps]=i;
			for(j=1;j<=ps && pr[j]*i<=n;j++)
			{
				np[pr[j]*i]=1;
				if(i%pr[j]==0) 
					break;
			}
		}
	}
	lint gcd(lint a,lint b)
	{
		while(b)
		{
			a%=b;
			a^=b^=a^=b;
		}
		return a;
	}
	int pollard_osu(lint nn)
	{
		if(nn==1) return 0;
		if(nn<=n && !np[nn]) return 0;
		int i;
		for(i=1;i<=25;i++) if(nn%pr[i]==0) return pr[i];
		int c = 1;
		while(1)
		{
			lint x=1,y=0;
			int tt = 1;
			while(x!=y)
			{
				lint d=gcd((x+nn-y)%nn,nn);
				if(d!=1 && d!=nn) return d;
				if(!(tt&(tt-1))) y = x;
				x = ((unsigned long long)x*x%nn+c)%nn;
				tt++;
			}
			c++;
		}
	}
	void dfs(int nn,lint d)
	{
		if(nn>tot)
		{
			ep[++etot]=d;
			return;
		}
		int l = 0;
		while(l+nn<=tot && fc[nn+l]==fc[nn]) l++;
		for(int i=0;i<=l && d<=n;i++,d*=fc[nn]) dfs(nn+l,d);
	}
	void split(lint nn)
	{
		fc[tot=1]=nn;
		lint d;
		for(int i=1;i<=tot;i++)
		{
			while((d=pollard_osu(fc[i])))
			{
				fc[++tot]=fc[i]/d;
				fc[i]=d;
			}
		}
		std::sort(fc+1,fc+1+tot);
		etot=0;
		dfs(1,1);
	}
}
bool magic(int nn,long double ii)
{
	if(ii<0 || ii>n+1) 
		return 0;
	lint i=(lint)(ii+0.5);
	if(ii-i>1e-5 || i-ii>1e-5) 
		return 0;
	if(i<1 || i>n) 
		return 0;
	if(ans[nn]) 
		return ans[nn]==i;
	long double ea=sqr(rx[i])+sqr(ry[i])+sqr(rz[i]);
	long double eb=-2*(rx[i]*aa[nn]+ry[i]*bb[nn]+rz[i]*cc[nn]);
	long double ec=sqr(aa[nn])+sqr(bb[nn])+sqr(cc[nn])-sqr(dd[nn]);
	long double del=eb*eb-4*ea*ec;
	if(del<0) return 0;
	del=sqrt(del);
	if(magic(nn-1,(-eb+del)/(2*ea)))
	{
		ans[nn]=i;
		return 1;
	}
	if(magic(nn-1,(-eb-del)/(2*ea)))
	{
		ans[nn]=i;
		return 1;
	}
	return 0;
}
int main()
{
	lint i,j;
	n = read(); 
	m = read();
	a = readf(); 
	b = readf();
	for(i=1;i<=n;i++)
	{
		rx[i] = readf();
		ry[i] = readf();
		rz[i] = readf();
	}
	int ls=0,ls2=0;
	for(i=1;i<=m;i++)
	{
		typ[i] = read();
		aa[i] = dc(readf())-1;
		bb[i] = dc(readf())-1;
		cc[i] = dc(readf())-1;
		dd[i] = dc(readf())-1;
	}
	OSU::init();
	bool fst = 1;
	for(int cur=1;cur<=m;cur++)
	{
		if(typ[cur]==0)
		{
			if(fst)
			{
				i = (lint)(aa[cur]*10+0.5);
				rx[i] = bb[cur]*10;
				ry[i] = cc[cur]*10;
				rz[i] = dd[cur]*10;
				ans[cur] = -233;
			}
			else
			{
				i = (lint)(aa[cur]+0.5);
				/*int je=(int)sqrt(i);
				et=0;
				for(j=1;j<=je;j++)
					if(i%j= = 0)
						 e p[++et]=j,ep[++et]=i/j;*/
				OSU::split(i);
				for(j=1;j<=OSU::etot;j++)
				{                          
					lint d1 = OSU::ep[j], d2 = i/d1;
					if(magic(cur-1,d2))
					{
						rx[d1] = bb[cur]/d2;
						ry[d1] = cc[cur]/d2;
						rz[d1] = dd[cur]/d2;
						ans[cur] = d2;
						break;
					}
				}
			}
		}
		else
		{
			if(fst)
			{
				for(i=1;i<=n;i++)
					if(abs(sqr(rx[i]-aa[cur]*10)+sqr(ry[i]-bb[cur]*10)+sqr(rz[i]-cc[cur]*10)-sqr(dd[cur])*100)<1e-5)
					{
						ans[cur] = i;
						break;
					}
				fst = 0;
			}
		}
	}
	for(i=1;i<=n;i++) if(magic(m,i)) break;
	for(i=1;i<=m;i++) if(typ[i]) printf("%d\n",ans[i]);
	return 0;
}