#include <bits/stdc++.h>
using namespace std;
 
#define ll long long int
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define cins(x) for (auto &i : x) cin >> i
#define vi vector<ll>
#define vvi vector<vi>
#define mii map<int, int>
#define pi 3.14159265358979323846264338327950
#define pii pair<int, int>
#define vpi vector<pii>
#define ff first
#define ss second
#define setbits(x) __builtin_popcount(x)
#define endl '\n';
#define pb push_back
#define f(i, a, b, c) for (int i = a; i < b; i += c)
#define rev(i, a, b, c) for (int i = a - 1; i >= b; i -= c)
#define FOR(x) for(auto it = x.begin();it!=x.end();it++)
#define COUT(x) for(auto &i : x) cout<<i<<" ";
 
#define Y cout<<"YES"<<endl
#define N cout<<"NO"<<endl
 
typedef unsigned long long ull;
typedef long double lld;
 
#ifndef krishna1922
#define debug(x) cerr << #x<<" "; _print(x); cerr << endl;
#else
#define debug(x);
#endif
 
//-----------------some_fxns-------------------//
 
bool isSquare(int x) {int y = sqrtl(x); return x == y * y;}
bool ispow2(int x) {return (x ? !(x & (x - 1)) : 0);}
int ceils(int x, int y) {return (x >= 0 ? (x + y - 1) / y : x / y);}
int gcd(int x, int y) {return (x ? gcd(y % x, x) : y);}
int lcm(int x, int y) {return x / gcd(x, y) * y;}
 
 
bool num_palindrome(ll n){
    ll ort= n,remainder,reversed=0;
    while (n != 0) {
        remainder = n % 10;
        reversed = reversed * 10 + remainder;
        n /= 10;
    }
    if(ort == reversed){
        return true;
    }else{
        return false;
    }
}
 
string binary(int num,int n){
    string s;
    for(int i = n-1;i>=0;i--){
        s.push_back(((num>>i)&1)+'0');        
    }
    return s;
}
 
//------------------------------------------------//
 
void _print(ll t) {cerr << t;}
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(double t) {cerr << t;}
void _print(ull t) {cerr << t;}
void google(int t) {cout << "Case #" << t << ": ";}
 
 
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T, class V> void _print(unordered_map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.ff); cerr << ","; _print(p.ss); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(unordered_set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
 
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
 
 
//--------------------------------------------SOLUTION OF THE PROBLEM--------------------------?//
 
 
void solve(){
    ll n, m;
    cin >> n >> m;
    vector<vector<int>> v(n, vector<int>(m, 0));
    for(auto &i : v)
        for(auto &e : i)
            cin >> e;
 
 
 
    // dp[i][x] = is it psbl to make a xor of x from i previous rows
    vector<vector<pair<int, int>>> dp(n+1, vector<pair<int,int>>(1024, {-1, -1}));
    for(int j =0;j<1024;j++){
            dp[0][j].first = 0;
    }
     dp[0][0].first = 1;
    for(int i = 1;i<n+1;i++){
        for(int j = 1;j<m+1;j++){
            for(int x = 0;x<1024;x++){
                if(dp[i-1][x^v[i-1][j-1]].first){
                    dp[i][x] = {1, j};
                }else{
                    dp[i][x].first = 0; 
                }
            }
        }
    }
 
    // for(int i = 0;i<n+1;i++){
    //     for(int j = 0;j<15;j++){
    //         cout<<dp[i][j].ff<<" "<<dp[i][j].ss<<"   ";
    //     }
    //     cout<<endl;
    // }
    for(int i = 1;i<1024;i++){
        if(dp[n][i].first){
 
            cout<<"TAK"<<endl;
            vector<int> choice(n, -1);
            
            int row = n,Xor = i;
            while(row>0){
                int cho = dp[row][Xor].second;
                choice[row-1] = cho;
                Xor = Xor ^ v[row-1][cho-1];
                
                row--;
                
            }
            for(int i = 0;i<n;i++){
                cout<<choice[i]<<" ";
            }
            cout<<endl;
            return;
        }
    }
 
    cout<<"NIE"<<endl;
    
 
 
 
}
int main(int argc, char const *argv[])
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    #ifndef krishna1922
        freopen("Error.in", "w", stderr);
    #endif
    
    int t=1;
    // cin >> t;
    while(t--){
        solve();
    }
    return 0;
}