Maximum number, GCD condition

Statement You will be given an array A of N integers. You need to answer M queries. Each query is of the form G x y. For each query, construct the set S from A. A[i] is included in S if x i y and GCD(G,A[i]) > 1. Let MAX be the maximum number present in S. Output MAX and number of occurances of MAX in S. If no such number exists, output "-1 -1" (without quotes). Input The first line of the inp