#include<bits/stdc++.h>
#define ull unsigned long long
using namespace std;
const int N=2e4;
ull Lsh(int x,int y){
  if(!y)return x;
  return (x<<y)|(x>>64-y);
}
struct elem{
  ull C,a[64];
  void clear(){
    C=0;
    for(int i=0;i<64;++i)a[i]=0;
  }
  ull Calc(ull x){
    ull ret=C;
    for(int i=0;i<64;++i)ret^=Lsh(x,i)&a[i];
    return ret;
  }
  elem operator*(const elem&y)const{
    static elem ret;
    ret.clear();
    ret.C=y.C;
    for(int i=0;i<64;++i){
      ret.C^=Lsh(C,i)&y.a[i];
      for(int j=0;j<64;++j){
        ret.a[i+j&63]^=Lsh(a[j],i)&y.a[i];
      }
    }
    return ret;
  }
}t[(N<<2)+10],ar[N+10],tmp;
int n,Q,C,m,op,sh;
int ql,qr,id;
ull B,v,qx;
void Upd(int x){
  t[x]=t[x<<1]*t[x<<1|1];
}
void Build(int x,int l,int r){
  if(l==r)return(void)(t[x]=ar[l]);
  int mid=(l+r>>1);
  Build(x<<1,l,mid),Build(x<<1|1,mid+1,r);
  Upd(x);
}
void Modify(int x,int l,int r,int id,elem&mv){
  if(l==r)return(void)(t[x]=mv);
  int mid=(l+r>>1);
  if(id<=mid)Modify(x<<1,l,mid,id,mv);
  else Modify(x<<1|1,mid+1,r,id,mv);
  Upd(x);
}
ull Query(int x,int l,int r,int nl,int nr,ull nw){
  if(l>nr||nl>r)return nw;
  if(nl<=l&&r<=nr)return t[x].Calc(nw);
  int mid=(l+r>>1);
  return Query(x<<1|1,mid+1,r,nl,nr,Query(x<<1,l,mid,nl,nr,nw));
}
int main(){
  //freopen("H2.in","r",stdin);
  cin.sync_with_stdio(0),cin.tie(0);
  cin>>n>>Q>>C;
  for(int i=1;i<=n;++i){
    cin>>m;
    for(int j=1;j<=m;++j){
      cin>>sh>>op>>v;
      if(!op)ar[i].C^=v,v=~v;
      ar[i].a[sh]=v;
    }
    cin>>B;
    ar[i].C^=B;
  }
  Build(1,1,n);
  while(Q--){
    cin>>op;
    if(!op){
      cin>>ql>>qr>>qx;
      cout<<Query(1,1,n,ql,qr,qx)<<"\n";
    }else{
      cin>>id;
      tmp.clear();
      cin>>m;
      for(int j=1;j<=m;++j){
        cin>>sh>>op>>v;
        if(!op)tmp.C^=v,v=~v;
        tmp.a[sh]=v;
      }
      cin>>B;
      tmp.C^=B;
      Modify(1,1,n,id,tmp);
    }
  }
  return 0;
}