// #include "koala.h"
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
static int N, W;
static int P[105];
static int maxQueries = 3200;
static int numQueries;
static void runGame(int F);
static void grader();
static void playRound(int *B, int *R);
int main() {
grader();
return 0;
}
int a = 0, b = 1;
int greaterValue(int N, int W) {
int B[N]{}, R[N];
int l = 1, r = W / 2;
while(l<=r){
int mid = (l + r) >> 1;
B[a] = B[b] = mid;
playRound(B, R);
if(R[a] + R[b] == 0){
r = mid - 1;
} else if(R[a] == 0){
return 1;
} else if(R[b] == 0){
return 0;
} else {
l = mid + 1;
}
}
return 0;
}
vector<int> dac(int l, int r, int N, int W){
// cout<<l<<" "<<r<<" "<<N<<" "<<W<<"\n";
if(l > r)return {};
if(l == r)return {l};
int m = (l + r) >> 1;
auto L = dac(l, m, N, W);
auto R = dac(m+1, r, N, W);
vector<int> ret;
int i = 0, j = 0;
while(i < L.size() && j < R.size()){
a = L[i];
b = R[j];
bool B = greaterValue(N, W);
if(B){
ret.push_back(L[i++]);
} else {
ret.push_back(R[j++]);
}
}
while(i < L.size()){
ret.push_back(L[i++]);
}
while(j < R.size()){
ret.push_back(R[j++]);
}
return ret;
}
void allValues(int N, int W, int *P) {
if (W == 2*N) {
auto v = dac(0, N-1, N, W);
vector<int>pos(N);
int i = 0;
for(auto x : v)
pos[x] = i++;
for(int i=0;i<N;i++){
P[i] = pos[i];
}
} else {
// TODO: Implement Subtask 5 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
}
}
void playRound(int *B, int *R) {
int i, j;
int S = 0;
for (i=0;i<N;++i) {
if ( !(B[i] >= 0 && B[i] <= W) ) {
printf("Invalid query.\n");
exit(0);
}
S += B[i];
}
if (S > W) {
printf("Invalid query.\n");
exit(0);
}
numQueries++;
if (numQueries > maxQueries) {
printf("Too many queries.\n");
exit(0);
}
int cache[2][205];
int num[2][205];
char taken[105][205];
for (i=0;i<205;++i) {
cache[1][i] = 0;
num[1][i] = 0;
}
for (i=0;i<N;++i) {
int v = B[i]+1;
int ii = i&1;
int o = ii^1;
for (j=0;j<=W;++j) {
cache[ii][j] = cache[o][j];
num[ii][j] = num[o][j];
taken[i][j] = 0;
}
for (j=W;j>=v;--j) {
int h = cache[o][j-v] + P[i];
int hn = num[o][j-v] + 1;
if (h > cache[ii][j] || (h == cache[ii][j] && hn > num[ii][j])) {
cache[ii][j] = h;
num[ii][j] = hn;
taken[i][j] = 1;
} else {
taken[i][j] = 0;
}
}
}
int cur = W;
for (i=N-1;i>=0;--i) {
R[i] = taken[i][cur] ? (B[i] + 1) : 0;
cur -= R[i];
}
}
static void runGame(int F) {
int i;
scanf("%d %d",&N,&W);
for (i=0;i<N;++i) {
scanf("%d",&P[i]);
}
numQueries = 0;
if (F == 1) {
// printf("%d\n", minValue(N, W));
} else if (F == 2) {
// printf("%d\n", maxValue(N, W));
} else if (F == 3) {
printf("%d\n", greaterValue(N, W));
} else if (F == 4) {
int userP[105];
allValues(N, W, userP);
for (i=0;i<N;i++) {
printf("%d ",userP[i]);
}
printf("\n");
}
printf("Made %d calls to playRound.\n", numQueries);
}
static void grader() {
int i;
int F, G;
scanf("%d %d",&F,&G);
for (i=0;i<G;i++) {
runGame(F);
}
}
