#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int a, b;
vector<int> Alist, Blist;
while (cin >> a >> b) {
Alist.insert(Alist.end(), a);
Blist.insert(Blist.end(), b);
}
for (int i = 0; i < Alist.size(); i++) {
int g = Alist[i];
int h = Blist[i];
if (h>=g)
for (int y = i+1; y < Blist.size() && Alist[y]<=h; ) { // start with next, stop if over target
if (Alist[y] == h && Blist[y] == g) {
Alist.erase(Alist.begin() + y);
Blist.erase(Blist.begin() + y);
cout << "found "<<h<<" "<<g<<endl;
}
else y++; // move to next only if current one was not erased
}
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CglpbnQgYSwgYjsgCgl2ZWN0b3I8aW50PiBBbGlzdCwgQmxpc3Q7IAoJCgl3aGlsZSAoY2luID4+IGEgPj4gYikgewogICAgICAgQWxpc3QuaW5zZXJ0KEFsaXN0LmVuZCgpLCBhKTsKICAgICAgIEJsaXN0Lmluc2VydChCbGlzdC5lbmQoKSwgYik7CiAgICB9CgkKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgQWxpc3Quc2l6ZSgpOyBpKyspIHsKICAgICAgICBpbnQgZyA9IEFsaXN0W2ldOwogICAgICAgIGludCBoID0gQmxpc3RbaV07CiAgICAgICAgaWYgKGg+PWcpCiAgICAgICAgICAgIGZvciAoaW50IHkgPSBpKzE7IHkgPCBCbGlzdC5zaXplKCkgJiYgQWxpc3RbeV08PWg7ICkgeyAgLy8gc3RhcnQgd2l0aCBuZXh0LCBzdG9wIGlmIG92ZXIgdGFyZ2V0CiAgICAgICAgICAgICAgICBpZiAoQWxpc3RbeV0gPT0gaCAmJiBCbGlzdFt5XSA9PSBnKSB7IAogICAgICAgICAgICAgICAgICAgIEFsaXN0LmVyYXNlKEFsaXN0LmJlZ2luKCkgKyB5KTsKICAgICAgICAgICAgICAgICAgICBCbGlzdC5lcmFzZShCbGlzdC5iZWdpbigpICsgeSk7CiAgICAgICAgICAgICAgICAgICAgY291dCA8PCAiZm91bmQgIjw8aDw8IiAiPDxnPDxlbmRsOyAKICAgICAgICAgICAgICAgIH0KICAgICAgICAgICAgICAgIGVsc2UgeSsrOyAvLyBtb3ZlIHRvIG5leHQgb25seSBpZiBjdXJyZW50IG9uZSB3YXMgbm90IGVyYXNlZAogICAgICAgICAgICB9CiAgICB9CgoJcmV0dXJuIDA7Cn0=
MSAgICAgNgoxICAgICA0CjIgICAgIDQKMiAgICAgNwoyICAgICA1CjIgICAgIDMKMyAgICAgOQozICAgICAyCjMgICAgIDUKNCAgICAgMQo0ICAgICA2CjUgICAgIDMKNSAgICAgMgo1ICAgICA4CjUgICAgIDkKNiAgICAgNAo2ICAgICAxCjcgICAgIDIKOCAgICAgNQo4ICAgICA5CjkgICAgIDMKOSAgICAgNQo5ICAgICA4
1 6
1 4
2 4
2 7
2 5
2 3
3 9
3 2
3 5
4 1
4 6
5 3
5 2
5 8
5 9
6 4
6 1
7 2
8 5
8 9
9 3
9 5
9 8