#include <bits/stdc++.h>
#include "koala.h"
using namespace std;
typedef long long ll;
int minValue(int n, int w){
int A[102] = {1};
int B[102] = {0};
playRound(A, B);
for(int i=0; i<n; i++){
if(B[i] <= A[i]) return i;
}
exit(1);
}
int maxValue(int N, int W) {
// TODO: Implement Subtask 2 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
return 0;
}
int greaterValue(int N, int W) {
// TODO: Implement Subtask 3 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
return 0;
}
void allValues(int N, int W, int *P) {
if (W == 2*N) {
// TODO: Implement Subtask 4 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
} else {
// TODO: Implement Subtask 5 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
}
}
