1 #include <cmath>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cstdlib>
 5 #include <iostream>
 6 #include <algorithm>
 7 
 8 using namespace std;
 9 
10 #define N 100005
11 #define M 200005
12 
13 int n, m;
14 
15 int fa[N];
16 int fg[N];
17 
18 int stk[N];
19 
20 int find(int u)
21 {
22     int tot = 0;
23     
24     while (u != fa[u])
25         stk[++tot] = u, u = fa[u];
26         
27     while (tot)
28         fa[stk[tot--]] = u;
29     
30     return u;
31 }
32 
33 signed main(void)
34 {
35     scanf("%d%d", &n, &m);
36     
37     for (int i = 1; i <= n; ++i)
38         fa[i] = i, fg[i] = false;
39         
40     for (int i = 1; i <= m; ++i)
41     {
42         int x; scanf("%d", &x);
43         int y; scanf("%d", &y);
44         
45         int fx = find(x);
46         int fy = find(y);
47         
48         if (fx ^ fy)
49         {
50             fa[fy] = fx;
51             fg[fx] |= fg[fy];
52         }
53         else
54             fg[fx] |= true;
55     }
56     
57     for (int i = 1; i <= n; ++i)
58         if (!fg[find(i)])
59             return puts("NIE"), 0;
60             
61     return puts("TAK"), 0;
62 }