#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <cmath>using namespace std;#define N 600050int fa[N], dis[N], siz[N], mp[N];int find(int x){if(x != fa[x]){int father = find(fa[x]);dis[x] += dis[fa[x]];return fa[x] = father;}return x;}void Union(int x, int y){int fx = find(x), fy = find(y);if(fx == fy)return ;fa[fx] = fy;siz[fy] += siz[fx];dis[x] = dis[y]+1;}int n,m;char s[20];int main(){int i,j,x,y,z;while(~scanf("%d %d",&n,&m)){memset(dis, 0, sizeof dis);for(int i = 1; i <= n+m; i++){fa[i] = mp[i] = i;siz[i] = 1;}int top = n+1;while(m--){scanf("%s",s);if(s[0]=='L'){scanf("%d %d",&x,&y);Union(mp[x],mp[y]);}else if(s[0]=='Q'){scanf("%d %d",&x,&y);x = mp[x], y = mp[y];if(find(x)!=find(y))puts("Unknown");else if((dis[x]-dis[y])&1) puts("Different");else puts("Same");}else if(s[0]=='S'){scanf("%d",&x);printf("%dn",siz[find(mp[x])]);}else {scanf("%d",&x);y = mp[x];siz[find(y)]--;mp[x] = top++;}}}return 0;}
