Money Heist

Professor is looking for a new member for a heist. To select a member he laid out a simple task. Given a map having $n$ cities and $m$ roads. He will ask you $q$ queries, in each query he will give you two cities and you have find minimum distance between the given two cities. All roads are bidirectional. ###Input: - First line will contain three integers $n,m,q$. - Then $m$ lines will fol