Problem: While resting on the ship after the "Russian Code Cup" a boy named Misha invented an interesting game. He promised to give his quadrocopter to whoever will be the first one to make a rectangular table of size n × m, consisting of positive integers such that the sum of the squares of numbers for each row and each column was also a square.

Since checking the correctness of the table manually is difficult, Misha asks you to make each number in the table to not exceed 108.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 100) — the size of the table. 

Output

Print the table that meets the condition: n lines containing m integers, separated by spaces. If there are multiple possible answers, you are allowed to print anyone. It is guaranteed that there exists at least one correct answer.

Examples

Input

1 1


Output

1

Input

1 2


Output

3 4

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.lang.*;
import java.math.*;

import static java.lang.Math.*;

public class Solution implements Runnable {
	
	int[] getMas(int n) {
		if (n ==  1)
			return new int[]{1};
		if (n == 2)
			return new int[]{3, 4};
		if (n % 2 == 0) {
			int res[] = new int[n];
			for (int i = 0; i < n - 1; i++)
				res[i] = 1;
			res[n - 1] = (n - 2) / 2;
			return res;
		} else {
			int res[] = new int[n];
			res[0] = 2;
			for (int i = 1; i < n - 1; i++)
				res[i] = 1;
			res[n - 1] = (n + 1) / 2;
			return res;
		}
	}
	
	public void solve() throws Exception {
		int n = sc.nextInt();
		int m = sc.nextInt();
		int a[] = getMas(n);
		int b[] = getMas(m);
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				out.print(a[i] * b[j] + " ");
			}
			out.println();
		}
	}
	
	static Throwable throwable;
	
	BufferedReader in;
	PrintWriter out;
	FastScanner sc;
	
	public static void main(String[] args) throws Throwable {
		Thread thread = new Thread(null, new Solution(), "", (1 << 26));
		thread.start();
		thread.join();
		if (throwable != null) {
			throw throwable;
		}
	}
	
	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
			//in = new BufferedReader(new FileReader(""));
			//out = new PrintWriter("");
			sc = new FastScanner(in);
			solve();
		} catch (Throwable throwable) {
			this.throwable = throwable;			
		} finally {
			out.close();
		}		
	}

}

class FastScanner {
	BufferedReader reader;
	StringTokenizer strTok;
	
	public FastScanner(BufferedReader reader) {
		this.reader = reader;
	}
	
	public String nextToken() throws Exception {
		while (strTok == null || !strTok.hasMoreTokens()) {
			strTok = new StringTokenizer(reader.readLine());
		}
		return strTok.nextToken();
	}
	
	public int nextInt() throws Exception {
		return Integer.parseInt(nextToken());
	}
	
	public long nextLong() throws Exception {
		return Long.parseLong(nextToken());
	}
	
	public double nextDouble() throws Exception {
		return Double.parseDouble(nextToken());
	}
}