Problem:
Score : 700 points

Problem Statement

You are given four integers: H, W, h and w (1 ≤ h ≤ H, 1 ≤ w ≤ W).
Determine whether there exists a matrix such that all of the following conditions are held, and construct one such matrix if the answer is positive:

The matrix has H rows and W columns.

Each element of the matrix is an integer between -10^9 and 10^9 (inclusive).

The sum of all the elements of the matrix is positive.

The sum of all the elements within every subrectangle with h rows and w columns in the matrix is negative.

Constraints

1 ≤ h ≤ H ≤ 500

1 ≤ w ≤ W ≤ 500

Input

Input is given from Standard Input in the following format:

H W h w

Output

If there does not exist a matrix that satisfies all of the conditions, print No.

Otherwise, print Yes in the first line, and print a matrix in the subsequent lines in the following format:

a_{11} ... a_{1W}
:
a_{H1} ... a_{HW}

Here, a_{ij} represents the (i,\ j) element of the matrix.

Sample Input 1

3 3 2 2

Sample Output 1

Yes
1 1 1
1 -4 1
1 1 1

The sum of all the elements of this matrix is 4, which is positive.
Also, in this matrix, there are four subrectangles with 2 rows and 2 columns as shown below. For each of them, the sum of all the elements inside is -1, which is negative.

Sample Input 2

2 4 1 2

Sample Output 2

No

Sample Input 3

3 4 2 3

Sample Output 3

Yes
2 -5 8 7
3 -5 -4 -5
2 1 -1 7

Solution in Rust (1.15.1) (judge verdict: Accepted)

fn main() {
    let (r, w) = (std::io::stdin(), std::io::stdout());
    let mut sc = IO::new(r.lock(), w.lock());
    let hh: usize = sc.read();
    let ww: usize = sc.read();
    let h: usize = sc.read();
    let w: usize = sc.read();
    if hh % h == 0 && ww % w == 0 {
        println!("No");
    } else if hh % h == 0 {
        sc.write("Yes\n");
        let ans = solve(ww, w);
        for _ in 0..hh {
            for i in 0..ww {
                if i > 0 {
                    sc.write(" ");
                }
                sc.write(ans[i].to_string());
            }
            sc.write("\n");
        }
    } else {
        sc.write("Yes\n");
        let ans = solve(hh, h);
        for i in 0..hh {
            for j in 0..ww {
                if j > 0 {
                    sc.write(" ");
                }
                sc.write(ans[i].to_string());
            }
            sc.write("\n");
        }
    }
}

fn solve(hh: usize, h: usize) -> Vec<i64> {
    // sum[hh] - sum[hh-h] < 0
    // sum[i+h] < sum[i]
    // sum[hh] > 0
    // sum[0] = 0
    let mut sum: Vec<i64> = vec![0; hh + 1];
    sum[hh] = 1;
    for i in (0..hh).rev() {
        if (hh - i) % h == 0 && i + h <= hh {
            sum[i] = sum[i + h] + 1;
        }
    }
    for i in 0..hh {
        if i + h <= hh {
            sum[i + h] = sum[i] - 1;
        }
    }
    let mut a = vec![0; hh];
    for i in 0..hh {
        a[i] = sum[i + 1] - sum[i];
    }
    a
}

pub struct IO<R, W: std::io::Write>(R, std::io::BufWriter<W>);

impl<R: std::io::Read, W: std::io::Write> IO<R, W> {
    pub fn new(r: R, w: W) -> IO<R, W> {
        IO(r, std::io::BufWriter::new(w))
    }
    pub fn write<S: std::ops::Deref<Target = str>>(&mut self, s: S) {
        use std::io::Write;
        self.1.write(s.as_bytes()).unwrap();
    }
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .0
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r' || b == b'\t')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r' && b != b'\t')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}