/*
#include <string>
#include <vector>
#include<iostream>
using namespace std;
int solution(int bridge_length, int weight, vector<int> truck_weights) {
int answer = 0;
int now_weight=0,number=0;
int arr[10001]={};
for(;;)
{
answer++;
if(now_weight+truck_weights[number]<=weight&&number<truck_weights.size()){
now_weight+=truck_weights[number];
number++;
}
for(int i=0;i<number;i++)
{
arr[i]++;
if(arr[i]==bridge_length){
now_weight-=truck_weights[i];
}
}
cout<<answer<<endl;
cout<<number<<endl;
cout<<now_weight<<endl;
if(number==truck_weights.size()&&now_weight==0) break;
}
return answer+1;
}
int main()
{
vector<int> truck_weights;
int bridge=100,weight=100;
truck_weights.push_back(10);
truck_weights.push_back(10);
truck_weights.push_back(10);
truck_weights.push_back(10);
truck_weights.push_back(10);
truck_weights.push_back(10);
truck_weights.push_back(10);
truck_weights.push_back(10);
truck_weights.push_back(10);
truck_weights.push_back(10);
int bridge=2,weight=10;
truck_weights.push_back(7);
truck_weights.push_back(4);
truck_weights.push_back(5);
truck_weights.push_back(6);
int result=solution(bridge,weight,truck_weights);
cout<<result<<endl;
}
*/
/*
#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
#include<iostream>
#include<vector>
#include<string>
using namespace std;
vector<int> solution(vector<int> prices) {
vector<int> answer;
for(int i=0;i<prices.size();i++)
{
int temp=0;
for(int j=i;j<prices.size();j++)
{
if(prices[i]>prices[j]){
answer.push_back(j-i);
temp=1;
break;
}
}
if(temp!=1){
answer.push_back(prices.size()-i-1);
}
}
return answer;
}
int main()
{
vector<int> prices;
prices.push_back(1);
prices.push_back(2);
prices.push_back(3);
prices.push_back(2);
prices.push_back(3);
vector<int> result = solution(prices);
for(int i=0;i<result.size();i++)
{
cout<<result[i]<<endl;
}
}
*/
/*
#include <string>
#include <vector>
#include<iostream>
using namespace std;
int dfs(int k,vector<int> numbers,int target,int is_true,int sum)
{
int count1=0;
if(is_true==1){
sum+=numbers[k];
}
else if(is_true==0){
sum-=numbers[k];
}
if(k==numbers.size()-1){
if(sum==target){
return 1;
}
else return 0;
}
else{
count1+=dfs(k+1,numbers,target, 1,sum);
count1+=dfs(k+1,numbers,target,0,sum);
}
return count1;
}
int solution(vector<int> numbers, int target) {
int answer = 0;
answer+=dfs(0,numbers,target,1,0);
answer+=dfs(0,numbers,target,0,0);
return answer;
}
int main()
{
vector<int> numbers;
numbers.push_back(4);
numbers.push_back(1);
numbers.push_back(2);
numbers.push_back(1);
int target=4;
int result=solution(numbers, target);
cout<<result<<endl;
}
*/
#include <string>
#include <vector>
using namespace std;
int solution(int n, vector<vector<int>> computers) {
int answer = 0;
return answer;
}