Problem: Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautiful to Levko if the sum of elements in each row and column of the table equals k.

Unfortunately, he doesn't know any such table. Your task is to help him to find at least one of them. 

Input

The single line contains two integers, n and k (1 ≤ n ≤ 100, 1 ≤ k ≤ 1000).

Output

Print any beautiful table. Levko doesn't like too big numbers, so all elements of the table mustn't exceed 1000 in their absolute value.

If there are multiple suitable tables, you are allowed to print any of them.

Examples

Input

2 4


Output

1 3
3 1


Input

4 7


Output

2 1 0 4
4 0 2 1
1 3 3 0
0 3 2 2

Note

In the first sample the sum in the first row is 1 + 3 = 4, in the second row — 3 + 1 = 4, in the first column — 1 + 3 = 4 and in the second column — 3 + 1 = 4. There are other beautiful tables for this sample.

In the second sample the sum of elements in each row and each column equals 7. Besides, there are other tables that meet the statement requirements.

Solution (in JAVA):

Solution:
/* package whatever; // don't place package name! */
 
import java.util.*;
import java.io.*;
 
/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
	public static Integer gcd(Integer a, Integer b)
	{
		if(b==0) return a;
		return gcd(b, a%b);
	}
	public static int mod(int x, int y)
	{
		return ((x%y)+y)%y;
	}
	public static void main(String[] args) throws java.lang.Exception{
		MyScanner sc = new MyScanner();
		PrintWriter out = new PrintWriter(System.out);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int[][]arr = new int[n][n];
		int j = 0;
		for(int i = 0;i<n;i++)
		{
			arr[i][j] = m;
			j++;
		}
		for(int i = 0;i<n;i++)
		{
			for(int h = 0;h<n;h++)
			{
				out.print(arr[i][h]+" ");
			}
			out.println();
		}
		out.close();
    }

	static class MyScanner{
        StringTokenizer st;
        BufferedReader br;
        public MyScanner(){br = new BufferedReader(new InputStreamReader(System.in));}
        public MyScanner(FileReader s) throws FileNotFoundException {	br = new BufferedReader(s);}
        public String next() throws IOException{
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }
        public int nextInt() throws IOException {return Integer.parseInt(next());}
        public long nextLong() throws IOException {return Long.parseLong(next());}
        public String nextLine() throws IOException {return br.readLine();}
        public double nextDouble() throws IOException { return Double.parseDouble(next()); }
        public boolean ready() throws IOException {return br.ready();}
    }
}