#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=1e9+9;
const int P=19260817;
int ksm(int x,int y,int p=mod){
	int ans=1;
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}
int cmod(int x){if(x>=mod)x-=mod;return x;}

void cmax(int &x,int v){x=max(x,v);}
void cmin(int &x,int v){x=min(x,v);}

const int N=1e5+5;
int n,q;

struct BIT_mod{
	int w[N];
	void clear(){memset(w,0,sizeof(w));}
	int lowbit(int x){return x&(-x);}
	void Add(int x,int v){for(int i=x;i<=n;i+=lowbit(i))add(w[i],v);}
	int qsum(int x){int res=0;for(int i=x;i;i-=lowbit(i))add(res,w[i]);return res;}
	int sum(int l,int r){return cmod(qsum(r)-qsum(l-1)+mod);}
};

int val[N];
namespace Hash{
	BIT_mod A,B;
	int Pw[N],Iv[N];
	void init(int V){
		A.clear(),B.clear();int IP=inv(P);
		Pw[0]=1;for(int i=1;i<=V;i++)Pw[i]=1ll*Pw[i-1]*P%mod;
		Iv[0]=1;for(int i=1;i<=V;i++)Iv[i]=1ll*Iv[i-1]*IP%mod;
	}
	// A[i] = p^{i-1} * w[i]
	// B[i] = p^{n-i} * w[i]
	void modify(int p,int c){
		int D=cmod(c-val[p]+mod);val[p]=c;
		A.Add(p,1ll*D*Pw[p-1]%mod),B.Add(p,1ll*D*Pw[n-p]%mod);
	}
	int q1(int l,int r){return 1ll*A.sum(l,r)*Iv[l-1]%mod;}
	int q2(int l,int r){return 1ll*B.sum(l,r)*Iv[n-r]%mod;}
}

using Hash::q1;
using Hash::q2;
using Hash::modify;

vector<int>nodes[N];
void add_palin(int l,int r){
	while(q1(l,r)!=q2(l,r)){
		int L=l,R=(l+r)>>1,res=R;
		assert(q1(l,R)!=q2(l+r-R,r));
		while(L<=R){
			int mid=(L+R)>>1;
			if(q1(l,mid)!=q2(l+r-mid,r))res=mid,R=mid-1;
			else L=mid+1;
		}
		int p=res,q=l+r-res;
		int x=val[p],y=val[q];
		if(nodes[x].size()>nodes[y].size())swap(x,y);
		for(int j:nodes[x])modify(j,y),nodes[y].emplace_back(j);
		nodes[x].clear();
	}
}

int query(int l,int r,int s,int t){
	if(t-s!=r-l)return -1;
	return q1(l,r)==q1(s,t);
}

signed main(void){

#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
#endif

	n=read(),q=read();
	Hash::init(n);
	for(int i=1;i<=n;i++)modify(i,i),nodes[i].emplace_back(i);
	for(int i=1;i<=q;i++){
		int op=read(),l=read(),r=read();
		if(op==1)add_palin(l,r);
		else{
			int s=read(),t=read();
			int res=query(l,r,s,t);
			if(res==-1)puts("Not equal");
			else if(res==0)puts("Unknown");
			else puts("Equal");
		}
	}

	return 0;
}