#include<bits/stdc++.h>
#define fir first
#define sec second
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
template<typename type>
inline void chmin(type &x,const type &y)
{
	if(y<x)
		x=y;
}
template<typename type>
inline void chmax(type &x,const type &y)
{
	if(x<y)
		x=y;
}
constexpr int Max=2e5+10,Size=27;
int n=1,m,lim;
int mod;
inline void mod_add(int &x,const int &y)
{
	x+=y;
	if(x>=mod)
		x-=mod;
}
inline int gcd(int x,int y)
{
	if(!x||!y)
		return x|y;
	while(y)
		swap(x%=y,y);
	return x;
}
inline void exgcd(int a,int b,int &x,int &y)
{
	if(!b)
		x=1,y=0;
	else
		exgcd(b,a%b,y,x),y-=a/b*x;
}
inline int inv(int a)
{
	static int x,y;
	exgcd(a,mod,x,y);
	return (x%mod+mod)%mod;
}
struct node
{
	int data[Size];
	inline void clear()
	{
		memset(data,0,sizeof(data));
	}
	inline node()
	{
		clear();
	}
	inline node(int k)
	{
		for(int i=0;i<lim;++i)
			data[i]=k%mod,k/=mod;
	}
	inline int operator [](const int &i)const
	{
		return data[i];
	}
	inline int &operator [](const int &i)
	{
		return data[i];
	}
	inline node operator *(const int &k)const
	{
		static node res;
		for(int i=0;i<lim;++i)
			res[i]=(ll)k*data[i]%mod;
		return res;
	}
	inline node operator +(const node &a)const
	{
		static node res;
		for(int i=0;i<lim;++i)
			res[i]=(data[i]+a[i])%mod;
		return res;
	}
	inline node operator -(const node &a)const
	{
		static node res;
		for(int i=0;i<lim;++i)
			res[i]=(data[i]-a[i]+mod)%mod;
		return res;
	}
};
struct linear_basis
{
	node data[Size];
	inline void insert(node p)
	{
		for(int i=lim-1;~i;--i)
			if(p[i])
			{
				if(!data[i][i])
				{
					data[i]=p*inv(p[i]);
					p=p*(mod/gcd(mod,p[i]));
				}
				else
					while(p[i])
					{
						int w=data[i][i]/p[i];
						data[i]=data[i]-p*w;
						swap(data[i],p);
					}
			}
	}
	inline node query(node p)
	{
		for(int i=lim-1;~i;--i)
		{
			if(!data[i][i])
				continue;
			p=p-data[i]*(p[i]/data[i][i]);
		}
		return p;
	}
}S;
int depth[Max],lg[Max];
int anc[Max][20];
node dis[Max];
inline int kth(int x,int k)
{
	for(;k;k^=1<<lg[k])
		x=anc[x][lg[k]];
	return x;
}
inline int lca(int x,int y)
{
	if(depth[x]<depth[y])
		swap(x,y);
	x=kth(x,depth[x]-depth[y]);
	if(x==y)
		return x;
	for(int i=lg[m];~i;--i)
		if(anc[x][i]!=anc[y][i])
			x=anc[x][i],y=anc[y][i];
	return anc[x][0];
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	cin>>m>>mod>>lim;
	for(int i=2;i<=m;++i)
		lg[i]=lg[i>>1]+1;
	node p;
	int opt,x,y,z;
	for(int o=1;o<=m;++o)
	{
		cin>>opt>>x>>y;
		if(opt==1)
		{
			++n;
			p=node(y);
			anc[n][0]=x,depth[n]=depth[x]+1,dis[n]=dis[x]+p;
			for(int i=1;i<=lg[m];++i)
				anc[n][i]=anc[anc[n][i-1]][i-1];
			S.insert(p+p);
		}
		if(opt==2)
		{
			cin>>z;
			p=node(z);
			S.insert(p+p);
			S.insert(p+dis[x]+dis[y]-dis[lca(x,y)]*2);
		}
		if(opt==3)
		{
			p=dis[x]+dis[y]-dis[lca(x,y)]*2;
			p=S.query(p);
			int ans=0;
			for(int i=lim-1;~i;--i)
				ans=ans*mod+p[i];
			cout<<ans<<"\n";
		}
	}
	return 0;
}