#include <iostream>
#include <queue>
#include <unordered_map>
#include <algorithm>

void init_container(std::unordered_map<std::size_t, std::size_t> *container, const std::size_t m){
	std::size_t weight;
	for(std::size_t i = 0; i < m; i++){
		std::cin >> weight;
		container->insert(i, weight);
	}
}

int main(){
	std::size_t n, m, a, b, k;
	std::priority_queue<int> warehouse;
	std::unordered_map<std::size_t, std::size_t> container;
}