A chocolate bar has a rectangular shape and consists of n × m slices. In other words, a bar consists of n rows with m slices of chocolate in each row. Each slice of chocolate is known to weigh 1 gram. Your task is to determine for each of the q chocolate bars whether it is possible to obtain a piece weighing p grams by breaking the bar several (possibly zero) times. The final piece of the chocolate bar should be whole, and breaks are made along the line of slices' section for the whole length of the current piece. The first line contains the positive integer q ( 1 ≤ q ≤ 100 ) — the number of chocolate bars. Each of the following q lines contains three positive integers n , m and p ( 1 ≤ n , m , p ≤ 1000 ) — the size of the chocolate bar, and the weight of the piece which should be obtained. The output should contain q lines and the i -th line must contain " Yes " (without the quotes), if it is possible to perform the task for i -th chocolate bar, or " No " otherwise.