http://codeforces.com/contest/1151/problem/B
题意:在每行选一个数使得选出的n个数异或后大于0;
思路:先构造n个数;如果不符合就在其中一行中找一个与该行选的数不同的数 ;
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x) memset(x,0,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=1e7+9;
const int mod=1e9+7;
inline ll read()
{
ll f=1,x=0;
char ss=getchar();
while(ss<'0'||ss>'9')
{
if(ss=='-')f=-1;ss=getchar();
}
while(ss>='0'&&ss<='9')
{
x=x*10+ss-'0';ss=getchar();
} return f*x;
}
int a[509][509];
int n,m;
int main()
{
FAST_IO;
//freopen("input.txt","r",stdin);
int ans=0;
cin>>n>>m;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
cin>>a[i][j];
}
ans^=a[i][1];
}
if(ans)
{
cout<<"TAK"<<endl;
for(int i=1;i<=n;i++)
{
cout<<1<<" ";
}
return 0;
}
for(int i=1;i<=n;i++)
{
for(int j=2;j<=m;j++)
{
if(a[i][j]!=a[i][1])
{
cout<<"TAK"<<endl;
for(int k=1;k<=n;k++)
{
if(k!=i) cout<<1<<" ";
else cout<<j<<" ";
}
return 0;
}
}
}
cout<<"NIE"<<endl;
return 0;
}