There are N cylindrical tubes each with radius r[i] and height
h[i] .Every tube has different radius .Tubes are placed such that all tubes have same center .
Dividing the whole setup into N regions . First region is the region inside the smallest radius tube.
Second region is region between smallest and second smallest radius tube and so on.
At the center there is a tap which releases water at a constant rate with time , volume of water given out by the tap is equal to pi
per second . You are given m queries , each query is a T(time) ,
you have to tell which is the maximum region where water has reached and the height of water in that region by this time .
Ignore the thickness of tubes .Note that maximun region will always be less than equal to N.
Assume tap starts just after t=0 .
First line contains N . Next N lines have integer
radius and heights of the tube . Next line contains M .
Next M line contains integer T . Output
For each query output the the maximum region where water has reached and the height of water in that region.
Print exactly two digits after decimal . Constraints 1<=N<=10^5 1<=M<=10^5 1<=r[i],h[i]<=10^6 1<=T<=10^18 Example Input