#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cassert>
#include<set>
#include<random>
#include<chrono>
#include<bitset>
#include<map>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<string>
#define eb emplace_back

using namespace std;
const int maxn=2e5+10, maxm=2e5+10, inf=1e9+10;
const double eps=1e-10, pi=acos(-1.0);
typedef long long LL;
typedef unsigned long long ULL;
const LL INF=4e18;
typedef pair<LL, int> pli;
typedef pair<int, int> pii;
typedef pair<int, LL> pil;
typedef pair<LL, LL> pll;
inline int read() {
	int x=0, f=1; char c=getchar();
	for(; c<'0'||c>'9'; c=getchar()) if(c=='-') f=0;
	for(; c>='0'&&c<='9'; c=getchar()) x=x*10+c-'0';
	return f?x:-x;
}inline LL readll() {
	LL x=0; int f=1; char c=getchar();
	for(; c<'0'||c>'9'; c=getchar()) if(c=='-') f=0;
	for(; c>='0'&&c<='9'; c=getchar()) x=x*10+c-'0';
	return f?x:-x;
}
int P;
mt19937_64 rnd((unsigned)chrono::steady_clock::now().time_since_epoch().count());
inline int ksm(int x, int y) {
	int s=1;
	for(; y; y>>=1, x=1LL*x*x%P)
		if(y&1) s=1LL*s*x%P;
	return s;
}
inline int add(int x, int y) {x+=y; return x>=P?x-P:x;}
inline int del(int x, int y) {x-=y; return x<0?x+P:x;}
inline int abs_(int x) {return x>0?x:-x;}
int gcd(int x, int y) {return y?gcd(y, x%y):x;}
LL gcdll(LL x, LL y) {return y?gcdll(y, x%y):x;}

int k, m;
struct pj{
    int a[30];
    pj operator+(const pj& b) const {
        pj c;
        for(int i=0; i<m; ++i) c.a[i]=add(a[i], b.a[i]);
        return c;
    }
    pj operator-(const pj& b) const {
        pj c;
        for(int i=0; i<m; ++i) c.a[i]=del(a[i], b.a[i]);
        return c;
    }
    pj operator*(const int& x) const {
        pj c;
        for(int i=0; i<m; ++i) c.a[i]=(1ll*a[i]*x%k+k)%k;
        return c;
    }
    pj operator=(const int& x) {
        int t=x; pj c;
        for(int i=0; i<m; ++i) c.a[i]=t%k, t/=k;
        return (*this)=c;
    }
    inline int getval() {
        int ret=0;
        for(int i=m-1; i>=0; --i) ret=ret*k+a[i];
        return ret;
    }
} b[30], dis[maxn];

inline void calc(int x, int y, pj& a, pj& b) {
    //->y=0
    int x0=1, x1=0, y0=0, y1=1;
    while(y!=0) {
    //   printf("x=%d y=%d\n", x, y);
     //   printf("(%d, %d) (%d, %d)\n", x0, x1, y0, y1);
        int t=x/y;
        x0-=y0*t; x1-=y1*t;
        x%=y;
        swap(x, y); swap(x0, y0); swap(x1, y1); 
    }
  //  printf("%d %d %d %d\n", x0, x1, y0, y1);
    pj na, nb;
    na=(a*x0)+(b*x1);
    nb=(a*y0)+(b*y1);
    a=na, b=nb;
}
inline void ins(pj x) {
    for(int i=m-1; i>=0; --i) if(x.a[i]) {
        if(b[i].a[i]==0) {
            b[i]=x;
            x=x*(k/gcd(k, x.a[i]));
            continue;
        }
        calc(b[i].a[i], x.a[i], b[i], x);
    }
}
int exgcd(int a, int b, int& x, int& y) {
    if(b==0) return x=1, y=0, a;
    int d=exgcd(b, a%b, y, x);
    return y-=a/b*x, d;
}
inline int query(pj v) {
    for(int i=m-1; i>=0; --i) if(v.a[i]&&b[i].a[i]) {
        int x, y;
        int d=exgcd(b[i].a[i], k, x, y);
        x=(x%(k/d)+(k/d))%(k/d);
        v=v-b[i]*(v.a[i]/x*x);
    }
    return v.getval();
}

int main() {
    int Q=read(), n=1;
    k=read(), m=read(); P=k;
    while(Q--) {
        int ty=read();
        if(ty==1) {
            int x=read(), v=read(); ++n;
            dis[n]=v;
            ins(dis[n]+dis[n]);
            dis[n]=dis[n]+dis[x];
          //  printf("dis[%d]=%d\n", n, dis[n].getval());
        } else if(ty==2) {
            int x=read(), y=read(), v=read();
            pj d; d=v;
            ins(dis[x]+dis[y]+d);
            ins(dis[y]-dis[x]+d);
        } else if(ty==3) {
            int x=read(), y=read();
            printf("%d\n", query(dis[x]+dis[y]));
        }
    }
    return 0;
}