#include<iostream>
#include<vector>
#include<unordered_set>
#include<time.h>
#include<random>
#define ULL long long
using namespace std;
const ULL N=1e5+10,P=131,mod=1e9+7;
int p[N],arr[N];
vector<int> v[N];

int find(int x)
{
    if(x!=p[x]) p[x]=find(p[x]);
    return p[x];
}
ULL ps[N];
void init()
{
    ps[0]=1;
    for(int i=1;i<N;i++) ps[i]=ps[i-1]*P%mod;
}


int n,m;
struct node
{
   ULL v1,v2;
}tr[N*10];

void up(int u,int l,int r)
{
    int mid=(l+r)>>1;
   
    tr[u].v1=(tr[u*2].v1+(tr[u*2+1].v1*ps[mid-l+1]%mod))%mod; //v1 右到左
    tr[u].v2=((tr[u*2].v2*ps[r-mid]%mod)+tr[u*2+1].v2)%mod;
}

void build(int u,int l,int r)
{
    if(l==r)
    {
        tr[u]={arr[l],arr[r]};
        return;
    }
    int mid=(l+r)/2;
    build(u*2,l,mid); build(u*2+1,mid+1,r);
    up(u,l,r);
   
}

void modf(int u,int l,int r,int x) 
{
    if(l==r)
    {
        tr[u]={arr[x]%mod,arr[x]%mod};
        return;
    }
    int mid=(l+r)/2;
    if(x<=mid) modf(u*2,l,mid,x);
    else modf(u*2+1,mid+1,r,x);
    up(u,l,r);
    // cout<<l<<" "<<r<<" "<<tr[u*2].v1<<"|"<<tr[u*2+1].v1<<"  "<<tr[u].v1<<"\n";
}

ULL quary(int u,int l,int r,int L,int R,int x) //1 左到右
{
    if(l>=L&&r<=R)
    {
        int mid=(l+r)>>1;
        if(!x) return tr[u].v1;
        else return tr[u].v2;
    }
    int mid=(l+r)>>1;
    ULL r1=0,r2=0;
    if(L<=mid) r1=quary(u*2,l,mid,L,R,x)%mod;
    if(R>mid) r2=quary(u*2+1,mid+1,r,L,R,x)%mod;
    ULL res=0;
    if(!x) res=(r1+(r2*ps[max(0,mid-max(l,L)+1)]%mod))%mod;
    else  res=(r2+(r1*ps[max(0,min(r,R)-(mid+1)+1)]%mod))%mod;
    return res%mod;
}



signed main()
{
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  init();
  
  cin>>n>>m;
  

  for(int i=1;i<=n;i++)
  {
    arr[i]=i;
    p[i]=i;
    v[i].push_back(i);
  }
  build(1,1,n);
 
  
  for(int i=1;i<=m;i++)
  {
    int fg=0; cin>>fg;

    if(fg==1)
    {
        int ls,rs; cin>>ls>>rs;
    
       
        while(true)
        {
            int l=0,r=(rs-ls+1);
            while(l<r)
            {
                int mid=((l+r)>>1)+1;
                int f1=quary(1,1,n,ls,ls+mid-1,1);
                int f2=quary(1,1,n,rs-mid+1,rs,0);
               
                if(f1==f2) l=mid;
                else r=mid-1;
            }
          
            
            
            int p1=ls+l,p2=rs-l;
            if(p1>=p2) break;
          
            p1=find(p1); p2=find(p2);
          
            if(v[p1].size()>v[p2].size()) swap(p1,p2);
            p[p1]=p2;
           
            for(auto c:v[p1])
            {
                arr[c]=arr[p2];
                
                v[p2].push_back(c);
           
                modf(1,1,n,c);
            }
            ls=ls+l+1; rs=rs-l-1;
            if(ls>=rs) break;
            
        }
       
  
        
    }
    else 
    {
       int l1,r1,l2,r2; cin>>l1>>r1>>l2>>r2;

       if(r1-l1!=r2-l2)
       {
        cout<<"Not equal\n";
        continue;
       }
       int f1=quary(1,1,n,l1,r1,1);
       int f2=quary(1,1,n,l2,r2,1);
     
       if(f1==f2)cout<<"Equal\n";
       else cout<<"Unknown\n";
    }
  }
}