#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;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8cXVldWU+CiNpbmNsdWRlIDx1bm9yZGVyZWRfbWFwPgojaW5jbHVkZSA8YWxnb3JpdGhtPgoKdm9pZCBpbml0X2NvbnRhaW5lcihzdGQ6OnVub3JkZXJlZF9tYXA8c3RkOjpzaXplX3QsIHN0ZDo6c2l6ZV90PiAqY29udGFpbmVyLCBjb25zdCBzdGQ6OnNpemVfdCBtKXsKCXN0ZDo6c2l6ZV90IHdlaWdodDsKCWZvcihzdGQ6OnNpemVfdCBpID0gMDsgaSA8IG07IGkrKyl7CgkJc3RkOjpjaW4gPj4gd2VpZ2h0OwoJCWNvbnRhaW5lci0+aW5zZXJ0KHtpLCB3ZWlnaHR9KTsKCX0KfQoKaW50IG1haW4oKXsKCXN0ZDo6c2l6ZV90IG4sIG0sIGEsIGIsIGs7CglzdGQ6OnByaW9yaXR5X3F1ZXVlPGludD4gd2FyZWhvdXNlOwoJc3RkOjp1bm9yZGVyZWRfbWFwPHN0ZDo6c2l6ZV90LCBzdGQ6OnNpemVfdD4gY29udGFpbmVyOwp9