The magic matrix of Captain Huang

Captain Huang has a a matrix C_N*M, each element E of C_N*M is positive and no more than 10000000.But Huang hope that every element in this matrix is between L and U, L indicates the lowerbound and U indicates the upperbound of these elements. Captain Huang want you to help her figure out  if there exists N numbers a₁, a₂, … a_n and M numbers b₁, b₂, …, b_m, which satisfies that after each elements in row-i multiplied with a_i and each elements in column-j divided by b_j,  every element in this matrix is between L and U.

There are several test cases. You should process to the end of file.
Each case includes two parts, in part 1, there are four integers in one line, N,M,L,U, indicating the matrix has N rows and M columns, L is the lowerbound and U is the upperbound (1<=N,M<=400,1<=L<=U<=10000). In part 2, there are N lines, each line includes M integers, and they are the elements of the matrix.(For each test case, each elements and L,U are a real number with precision up to eight decimal places)

If there is a solution print "YES", else print "NO".

3 3 1 6
2 3 4
8 2 6
5 2 9

YES