// what is matter? never mind.
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
//#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}
// modint
int mod;
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 500005
#define inf 0x3f3f3f3f

int n,m,q;

#define poly vector<modint>
poly get(int x){
	poly o(m);
	For(i,0,m-1)o[i]=x%mod,x/=mod;
	return o;
}
int get(poly o){
	int x=0;
	Rep(i,m-1,0)x=x*mod+o[i].x;
	return x;
}
poly operator +(poly a,poly b){
	int n=max(a.size(),b.size());a.resize(n),b.resize(n);
	For(i,0,n-1)a[i]+=b[i];return a;
}
poly operator -(poly a,poly b){
	int n=max(a.size(),b.size());a.resize(n),b.resize(n);
	For(i,0,n-1)a[i]-=b[i];return a;
}
poly operator *(poly a,modint b){
	int n=a.size();
	For(i,0,n-1)a[i]*=b;return a;
}

poly dis[maxn];
poly bs[33];
void ins(poly a){
//	for(auto x:a)cout<<x.x<<" ";puts("ins");
	Rep(i,m-1,0){
		if(!a[i].x)continue;
		if(!bs[i].size()){
			bs[i]=a;
			int t=mod/__gcd(a[i].x,mod);
			a=a*t;
			assert(!a[i].x); 
		}
		while(a[i].x){
			int t=bs[i][i].x/a[i].x;
			bs[i]=bs[i]-a*t;
			swap(a,bs[i]);
		}
	}
}

void exgcd(int a,int b,int&x,int&y){
	if(!b)return x=1,y=0,void();
	exgcd(b,a%b,y,x),y-=a/b*x;
}
int inv(int a){
	int x,y;
	exgcd(a,mod,x,y);
	x=(x%mod+mod)%mod;
	return x;
}

poly ask(poly a){
//	for(auto x:a)cout<<x.x<<" ";puts("ask");
	Rep(i,m-1,0){
		if(bs[i].size()){
			modint x=inv(bs[i][i].x);
			int g=__gcd(bs[i][i].x,mod);
			int r=a[i].x%g;
			modint t=(a[i].x/g)*x;
			a=a-bs[i]*t;
			assert(a[i].x==r); 
		}
	}return a;
}

signed main()
{
	q=read(),mod=read(),m=read();
	dis[n=1].resize(m);
	For(_,1,q){
		int op=read(),x,y,v;
		if(op==1){
			x=read(),y=read();
			poly w=get(y);
			dis[++n]=dis[x]+w;
			ins(w+w);
		}
		if(op==2){
			x=read(),y=read(),v=read();
			poly w=get(v);
			ins(w+w);
			ins(dis[x]+dis[y]+w);
		}
		if(op==3){
			x=read(),y=read();
			cout<<get(ask(dis[x]+dis[y]))<<"\n";
		}
	}
	return 0;
}