#include <cstdio>
#include <algorithm>
using namespace std;
int v[100005],n,j,i,m,x,y,caz,mn,mx,vmx;;
int main() {
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
	scanf("%d %d",&m,&n);
	for (i=1;i<=m;i++) v[i]=i;
	for (i=1;i<=n;i++) {
		scanf("%d",&caz);
		if (caz==1) {
			scanf("%d %d",&x,&y);
			mn=min(x,y);
			mx=x+y-mn;
			vmx=v[mx];
			for (j=mn;j<=n;j++) if (v[j]==vmx) v[j]=v[mn];
		}
		else if (caz==2) {
			scanf("%d %d",&x,&y);
			if (v[x]==v[y]) printf("DA\n");
			else printf("NU\n");
		}
	}
	return 0;
}