#C2171. Smoothie Recipe Checker

    ID: 45458 Type: Default 1000ms 256MiB

Smoothie Recipe Checker

Smoothie Recipe Checker

Chef wants to prepare a number of delicious smoothies for his friends. To make one smoothie, Chef needs a fixed amount of bananas and strawberries. Given the available ingredients and the recipe requirements, determine whether Chef can make the desired number of smoothies.

The recipe is defined as follows: Each smoothie requires \(M\) bananas and \(N\) strawberries. Chef currently has \(P\) bananas and \(Q\) strawberries. You are also given an integer \(K\) which denotes the number of smoothies Chef wants to make. Chef can successfully prepare the smoothies only if \(P \geq M \times K\) and \(Q \geq N \times K\).

Your task is to write a program that reads multiple test cases from standard input and outputs whether Chef has sufficient ingredients for each case.

inputFormat

The first line contains an integer \(T\) (the number of test cases). Each of the next \(T\) lines contains 5 space-separated integers \(M\), \(N\), \(P\), \(Q\), and \(K\) respectively.

\(M\): Number of bananas required for one smoothie.
\(N\): Number of strawberries required for one smoothie.
\(P\): Number of bananas available.
\(Q\): Number of strawberries available.
\(K\): Number of smoothies to make.

outputFormat

For each test case, output a single line containing YES if Chef has enough ingredients for \(K\) smoothies; otherwise, output NO.

## sample
1
2 3 10 10 3
YES