# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 lll;
typedef vector<int> Num;
int K,m;
Num dep[200010],d[30];
int add(int a,int b){return (a+=b)>=K?a-K:a;}
Num operator+(const Num &a,const Num &b)
{
	Num ans(m);
	for(int i=0;i<m;i++) ans[i]=add(a[i],b[i]);
	return ans;
}
Num Val(int v)
{
	Num ans(m);
	for(int i=0;i<m;i++) ans[i]=v%K,v/=K;
	return ans;
}
void insert(Num a)
{
	for(int i=m-1;i>=0;i--)
		if(a[i])
		{
			if(d[i].empty()) return d[i]=a,void();
			while(a[i])
			{
				int t=d[i][i]/a[i];
				for(int j=0;j<=i;j++) d[i][j]=(d[i][j]+(ll)(K-t)*a[j])%K;
				swap(d[i],a);
			}
		}
}
int exgcd(int a,int b,int &x,int &y)
{
	if(!b) return x=1,y=0,a;
	int g=exgcd(b,a%b,y,x);
	y-=a/b*x;
	return g;
}
int query(Num a)
{
	int ans=0;
	for(int i=m-1;i>=0;i--)
	{
		ans*=K;
		if(!d[i].empty())
		{
			int x,y,g=exgcd(d[i][i],K,x,y),r=a[i]%g;
			if((x%=K)<0) x+=K;
			ll t=(ll)(a[i]-r)/g*(K-x)%K;
			for(int j=0;j<=i;j++) a[j]=(a[j]+t*d[i][j])%K;
		}
		ans+=a[i];
	}
	return ans;
}
int main()
{
	int q,n=1,x,y,v,op;
	cin>>q>>K>>m;
	dep[1].resize(m);
	while(q--)
	{
		scanf("%d",&op);
		if(op==1) scanf("%d%d",&x,&v),dep[++n]=dep[x]+Val(v),insert(Val(v)+Val(v));
		else if(op==2) scanf("%d%d%d",&x,&y,&v),insert(dep[x]+dep[y]+Val(v));
		else scanf("%d%d",&x,&y),printf("%d\n",query(dep[x]+dep[y]));
	}
	return 0;
}