TAKNIE

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (200002)
vi g[MX];
int N,M,a,b,C[MX];
void dfs(int u,int c){
    if(C[u])return;
    C[u]=c;
//    for(auto&h:g[u])dfs(h,-c);
    F(int(g[u].size()))dfs(g[u][i],-c);
}
int main(void){
    scanf("%d%d",&N,&M);
    F(M)scanf("%d%d",&a,&b),g[--a].PB(--b),g[b].PB(a);
    F(N)if(!C[i])dfs(i,1);
    F(N)if(g[i].empty())return puts("NIE"),0;
    puts("TAK");
    F(N)printf("%c\n",~C[i]?'K':'S');
    return 0;
}