CodeForces

Square Table

Time Limit: 1000MS

Memory Limit: 262144KB

64bit IO Format: %I64d & %I64u

Submit Status

Description

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 10⁸.

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.

Sample Input

Input

1 1

Output

1

Input

1 2

Output

3 4

Source

RCC 2014 Warmup (Div. 2)

 

#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
bool pd(int s)
{
    int k=sqrt(s);
    return k*k==s;
}
int main()
{
    int n,m,a,b,c,d,i,j;
    while(cin>>n>>m)
    {
       for (a=1;a<=100;a++)
       for (b=1;b<=100;b++)
       for (c=1;c<=100;c++)
       for (d=1;d<=100;d++)
       {
           int s1=(m-1)*a*a+b*b;
           int s2=(n-1)*a*a+c*c;
           int s3=(n-1)*b*b+d*d;
           int s4=(m-1)*c*c+d*d;
           if (pd(s1)&&pd(s2)&&pd(s3)&&pd(s4))
           goto next;
       }
       next:
       for (i=1;i<n;i++)
       {
           for (j=1;j<m;j++)
           cout<<a<<" ";
           cout<<b<<endl;
       }
       for (i=1;i<m;i++)
       cout<<c<<" ";
       cout<<d<<endl;
    }
    return 0;
}