Problem: The great hero guards the country where Homer lives. The hero has attack power A and initial health value B. There are n monsters in front of the hero. The i-th monster has attack power a_i and initial health value b_i. 

The hero or a monster is said to be living, if his or its health value is positive (greater than or equal to 1); and he or it is said to be dead, if his or its health value is non-positive (less than or equal to 0).

In order to protect people in the country, the hero will fight with monsters until either the hero is dead or all the monsters are dead.

  * In each fight, the hero can select an arbitrary living monster and fight with it. Suppose the i-th monster is selected, and the health values of the hero and the i-th monster are x and y before the fight, respectively. After the fight, the health values of the hero and the i-th monster become x-a_i and y-A, respectively. 



Note that the hero can fight the same monster more than once.

For the safety of the people in the country, please tell them whether the great hero can kill all the monsters (even if the great hero himself is dead after killing the last monster).

Input

Each test contains multiple test cases. The first line contains t (1 ≤ t ≤ 10^5) — the number of test cases. Description of the test cases follows.

The first line of each test case contains three integers A (1 ≤ A ≤ 10^6), B (1 ≤ B ≤ 10^6) and n (1 ≤ n ≤ 10^5) — the attack power of the great hero, the initial health value of the great hero, and the number of monsters.

The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^6), where a_i denotes the attack power of the i-th monster.

The third line of each test case contains n integers b_1, b_2, ..., b_n (1 ≤ b_i ≤ 10^6), where b_i denotes the initial health value of the i-th monster.

It is guaranteed that the sum of n over all test cases does not exceed 10^5.

Output

For each test case print the answer: "YES" (without quotes) if the great hero can kill all the monsters. Otherwise, print "NO" (without quotes).

Example

Input


5
3 17 1
2
16
10 999 3
10 20 30
100 50 30
1000 1000 4
200 300 400 500
1000 1000 1000 1000
999 999 1
1000
1000
999 999 1
1000000
999


Output


YES
YES
YES
NO
YES

Note

In the first example: There will be 6 fights between the hero and the only monster. After that, the monster is dead and the health value of the hero becomes 17 - 6 × 2 = 5 > 0. So the answer is "YES", and moreover, the hero is still living.

In the second example: After all monsters are dead, the health value of the hero will become 709, regardless of the order of all fights. So the answer is "YES".

In the third example: A possible order is to fight with the 1-st, 2-nd, 3-rd and 4-th monsters. After all fights, the health value of the hero becomes -400. Unfortunately, the hero is dead, but all monsters are also dead. So the answer is "YES".

In the fourth example: The hero becomes dead but the monster is still living with health value 1000 - 999 = 1. So the answer is "NO".

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#include <iostream>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;

#define f(i,n)           for(int i=0;i<n;i++)
#define pb               push_back
#define fi               first
#define se               second
#define setzero(a)       memset(a,0,sizeof(a))
#define precision(x,y)   fixed<<setprecision(y)<<x
#define mod              1000000007

// primeNumbers contains all the prime numbers till 1299720 (100000 prime numbers)
int primeNumbers[100000];
void SieveOfEratosthenes(int n)     // O(nlog(log(n)))
{
    bool prime[n+1]; 
    memset(prime, true, sizeof(prime)); 
  
    for (int p=2; p*p<=n; p++) 
    {
        if (prime[p] == true) 
        { 
            for (int i=p*p; i<=n; i += p) 
                prime[i] = false; 
        } 
    }
    int i=0;
    for (int p=2; p<=n; p++) 
       if (prime[p]) 
       {
           primeNumbers[i] = p;
           i ++;
       }
}

int binarySearch(int arr[], int l, int r, int x)  // Recursive 
{ 
    if (r >= l) 
    { 
        int mid = l + (r - l) / 2; 
  
        if (arr[mid] == x) 
            return mid; 
   
        if (arr[mid] > x) 
            return binarySearch(arr, l, mid - 1, x); 
  
        return binarySearch(arr, mid + 1, r, x); 
    } 
  
    // We reach here when element is not present in array
    return -1; 
}

/*Driver Code*/
int main() {
    
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
	ll t;
	cin >> t;
	while(t--)
	{
	    ll a,b,n;
        cin>>a>>b>>n;
        ll h[n];
        ll atp[n];
        f(i,n)
        {
            cin >> atp[i];
        }
        f(i,n)
        {
            cin >> h[i];
        }
        vector<pair<ll,ll>>v;
        f(i,n)
        {
            v.push_back({atp[i],h[i]});
        }
        
        sort(v.begin(),v.end());
        
        bool ans = true;
        
        f(i,n)
        {
            if(b<=0)
            {
                ans = false;
                break;
            }
            ll x = v[i].first;
            ll y = v[i].second;
            ll z = y/a;
            if(y%a != 0)
                z++;
            b = b - (z-1)*x;
            if(b <= 0)
            {
                ans = false;
                break;
            }
            b = b - x;
        }
        
        
        if(ans+2-2)
            cout << "YES\n";
            
            
        else
            cout<<"NO\n";
	}
	return 0;
}