1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cmath>


using namespace std;
vector<vector<long long > > numbers;

long long LIMIT = 1000000000000000000L;

void makeNumbers(int n){
  numbers.resize(n);
  numbers[0].push_back(1);
  numbers[0].push_back(0);
  
  for(int i=1; i<n; ++i){
    long long sum = 0l;
    for(int j=0; j<=i; ++j){
      if(j < numbers[i-1].size()){
        sum += numbers[i-1][j];
      }
      if(sum > LIMIT){
        numbers[i].push_back(min(sum, 2*LIMIT));
        break;
      }
      numbers[i].push_back(sum);
    }
    if(sum >= 2*LIMIT){
      continue;
    }
    int j = i+1;
    while(sum > 0){
      if(j < numbers[i-1].size()){
        sum += numbers[i-1][j];
      }
      sum -= numbers[i-1][j-i-1];
      if(sum > LIMIT){
        numbers[i].push_back(min(sum, 2*LIMIT));
        break;
      }
      numbers[i].push_back(sum);
      j++;
    }
  }
}

bool hasKMUnBalanced(long long k, long long n, long long m){
  m = min(m, n*(n-1)/2-m);
  if(m < 0){
    return false;
  }
  
  if((long)numbers[(int)n-1].size() < m){
      return numbers[(int)n-1][numbers[(int)n-1].size()-1] >= k;
  } else {
    return (long long)numbers[(int)n-1][(int)m] >= k;
  }
}

bool hasKBalanced(long long k, long long n){
  long long bInv = n*(n-1);
  long long m4 = bInv&3;
  if(m4 == 3 || m4 == 2){
    return false;
  }
  bInv >>=2;
  return hasKMUnBalanced(k,n,bInv);
  
}

vector<int> findKthM(long long k, long long m, int n){
  vector<int> ret;
  while(n>2){ 
    for(int i=0;i<n;++i){
      if(hasKMUnBalanced(k, n-1, m-i)){
        ret.push_back(i);
        m = m-i;
        break;
      } else {
        long long m2 = min((long long)(n-2)*(long long)(n-1)/2L-m+i,m-i);
        if(m2>=0){
          k -= numbers[n-2][(int)m2];
        } else {
          if(m2 < -10){
//             printf("%lld\n", m2);
            i = -(long long)(n-2)*(long long)(n-1)/2L+m - 1;
            
          }
        }
      }
    }
    n--;
  }
  
  if(n == 1){
    ret.push_back(0);
    return ret;
  }
  
  
  if(n == 2){
    if(m == 0){
      ret.push_back(0);
    } else {
      ret.push_back(1);
    }
    ret.push_back(0);
    return ret;
  }
  return ret;
}

//BIT

int highestOneBit(int i) {
    i |= (i >>  1);
    i |= (i >>  2);
    i |= (i >>  4);
    i |= (i >>  8);
    i |= (i >> 16);
    return i - (i >> 1);
}

vector<int> t;
int BITn;
void BITini(int n){
  BITn = highestOneBit(n)<<1;
  t.resize(BITn<<1);
  for(int i=0;i<2*BITn;++i){
    t[i] = 0;
  }
}

void inc(int p){
  p+=BITn;
  while(p>1){
    t[p]++;
    p>>=1;
  }
}

void dec(int p){
  p+=BITn;
  while(p>1){
    t[p]--;
    p>>=1;
  }
}

int find(int k){
  int id = 1;
  while(id < BITn){
    if(k > t[id<<1]){
      k-= t[id<<1];
      id = (id<<1) + 1;
    } else {
      id = (id<<1);
    }
  }
  return id-BITn;
}


int main(){
  long long n,k;
  scanf("%lld %lld", &n, &k);
  makeNumbers(n);
//   for(int i=0;i<numbers.size();++i){
//     for(int j=0;j<numbers[i].size();++j){
//       printf("%lld ", numbers[i][j]);
//     }
//     printf("\n");
//   }
  
  if(!hasKBalanced(k,n)){
    printf("NIE\n");
  } else {
    printf("TAK\n");
    
    vector<int> tmp = findKthM(k, n*(n-1)/4, (int)n);
    
    BITini(n);
    for(int i=0;i<n;++i){
      inc(i+1);
    }
    for(int i=0;i<tmp.size();++i){
      int p  = find(tmp[i]+1);
      printf("%d ", p);
      dec(p);
    }
  }
  
  
  
  return 0;
}