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.text.DecimalFormat;
import java.util.*;

public class Main {
	static int mod = (int)1e9+7;
	static int inf = (int)1e9+7;
	static int N = 1005;
	int[] a = new int[N], b = new int[N];
	int n, m;
	
    void work() throws Exception {
    	//in = new BufferedReader(new InputStreamReader(System.in));
    	out = new PrintWriter(System.out);
    	//
    	Scanner cin = new Scanner(System.in);
    	/////////////////////////////////////////
    	n = cin.nextInt(); m = cin.nextInt();
    	if(n == 1) a[1]=1;
    	else if(n==2) {
    		a[1]=3; a[2]=4;
    	} else {	
    		if(n % 2 == 0) {
    			for(int i = 1; i < n; i ++) a[i]=1;
    			a[n] = n/2-1;
    		} else {
    			a[1] = 2;
    			for(int i = 2; i < n; i ++) a[i]=1;
    			a[n] = (n+1)/2; 
    		}
    	}
    	if(m == 1) b[1]=1;
    	else if(m==2) {
    		b[1]=3; b[2]=4;
    	} else {	
    		if(m % 2 == 0) {
    			for(int i = 1; i < m; i ++) b[i]=1;
    			b[m] = m/2-1;
    		} else {
    			b[1] = 2;
    			for(int i = 2; i < m; i ++) b[i]=1;
    			b[m] = (m+1)/2; 
    		}
    	}
    	for(int i = 1; i <= n; i ++) {
    		for(int j = 1; j <= m; j ++) out.print(a[i]*b[j] + " ");
    		out.println();
    	}
    }  
    static PrintWriter out;
  //  BufferedReader in;
  //  StringTokenizer str = null;
//    private String next() throws Exception{
//    	while (str == null || !str.hasMoreElements())
//    	    str = new StringTokenizer(in.readLine());
//    	return str.nextToken();
//    } 
//    private int nextInt() throws Exception{
//    	return Integer.parseInt(next());
//    }
//    private long nextLong() throws Exception{
//    	return Long.parseLong(next());
//    }
    static int dx[] = {0,1,0,-1};
    static int dy[] = {1,0,-1,0};
    class pair implements Comparable<pair>{
    	int first, second;
    	pair(int x, int y) {
    		first = x;
    		second = y;
    	}
		public int compareTo(pair o) {
			// TODO auto-generated method stub
			if(first != o.first) return ((Integer)first).compareTo(o.first);
			else return ((Integer)second).compareTo(o.second); 
		}
    }
    DecimalFormat df=new DecimalFormat("0.000000");
    public static void main(String[] args) throws Exception{
        Main wo = new Main();
        wo.work();
        out.close();
    }
}