I have a problem and today I want to ask if this question have an answer or not! We have a graph and Jafar and Omidaz are at nodes x and y, each time Kodser destroys e node and asks is there a path between Omidaz and Jafar or not! If the answer was negative Kodser puts the node back and it doesn't destroy, at the end Shakheshoon want's to know how many nodes are destroyed! nodes < 3e6, questions < 3e6