2734. Business Cards

单点时限: 10.0 sec

内存限制: 256 MB

Running a paper shop is not an easy job, especially with harsh customers. Today they brought their own rectangular sheets of paper, asking you to cut it into rectangular business cards of specific size. Moreover, they require that all the paper (which may not be cheap, but is definitely not that expensive!) has to be used, i.e. no tiny bit may be left over. Moreover, the brilliant idea of cutting the sheet into very small pieces, and then gluing them together in desired sheets was laughed at.

An example of a 9 × 6 paper sheet divided into 2 × 3 cards is given below.

输入格式

The input contains several test cases. The first line contains the number of test cases t (t ≤ 105 ). Then t test cases follow. Each of them consists of one line containing four integers a, b, c, d (1 ≤ a, b, c, d ≤ 109 ). Numbers a and b are dimensions of each business card; c and d are dimensions of the paper sheet.

输出格式

For each test case output one line containing word YES if it is possible to divide the whole sheet into business cards, and NO otherwise.

样例

Input
4
2 3 9 6
2 3 8 6
2 3 6 8
2 3 5 7
Output
YES
YES
YES
NO

1 人解决,2 人已尝试。

1 份提交通过,共有 4 份提交。

9.8 EMB 奖励。

创建: 11 年,11 月前.

修改: 4 年前.

最后提交: 10 月前.

来源: Central European Programming Contest 2008

题目标签