Geek is given an array nums of length n and two integers x and y. Geek is interested to find the total number of pairs (i, j) such that x <= a[i]*a[j] <= y (1 <= i < j <= n).
Help geek to find the total number of such pairs.

Example 1:

Input: nums[] = {5,3,7,9,7,9,7,7},
x = 7, y = 19
Output: 1
Explanation: There is only one pair which
satisfies the given conditions. The pair is
(1,2).

Example 2:

Input: nums[] = {3,5,5,2,6}, x = 8, y = 13
Output: 3
Explanation: Pairs which satisfiy the given
conditions are (2,4), (3,4), (4,5).

Constraints:
1 <= n <= 104
1 <= nums[i] <= 10^4
1 <= x <= y <= 10^8

int TotalPairs(vector<int>&A, int x, int y){
	    int res=0;
	    
	    sort(A.begin(),A.end());
	    for(int i=0;i<A.size();i++)
	    {
	        int low=ceil((float)x/(float)A[i]);
	        int up=floor((float)y/(float)A[i]);
	        
	        int num1=lower_bound(A.begin()+i+1,A.end(),low)-A.begin();
	        int num2=upper_bound(A.begin()+i+1,A.end(),up)-A.begin();
	        
	        res+=num2-num1;
	    }
	    
	    return res;
	}

int TotalPairs(vector<int>&A, int x, int y){
	    int res=0;
	    
	    sort(A.begin(),A.end());
	    for(int i=0;i<A.size();i++)
	    {
	        int low=ceil((float)x/(float)A[i]);
	        int up=(y/A[i]);
	        
	        int num1=lower_bound(A.begin()+i+1,A.end(),low)-A.begin();
	        int num2=upper_bound(A.begin()+i+1,A.end(),up)-A.begin();
	        
	        res+=num2-num1;
	    }
	    
	    return res;
	}