#include <bits/stdc++.h>

using namespace std;


typedef long long                               ll;
typedef unsigned long long                      ull;
#define int                                     long long
#define itn                                     int
#define endl                                    '\n'
#define Endl                                    endl
#define ednl                                    endl
#define al(a)                                   (a).begin(),(a).end()
#define all(a)                                  (a).begin()+1,(a).end()
#define debug(x)                                {cerr<<"ss:"<<x<<endl;}
#define qdebug(x)                               {cerr<<"ss:";for(auto i:x)cout<<i<<" ";cout<<endl;}
#define lowbit(x)                               (x&-x)
#define vi                                      vector<int>
#define pii                                     pair<int,int>
#define pb                                      push_back
#define fs                                      first
#define sc                                      second

constexpr long long maxlonglong = 9223372036854775807;   //9e18
constexpr int maxint = 2147483647;      //2e9
constexpr int INF = 0x7f7f7f7f7f7f7f7f; //2139062143^2
// constexpr int mod = 1e9 + 7;
constexpr int mod =  998244353;
constexpr int hs = 0x1F351F35; // good hash number.
const double pi = acos(-1.0);
const double eps = 1e-15;
vector<int> input(int n){vector<int> a(n+1);for(int i=1;i<=n;i++)cin>>a[i];return a;}
mt19937_64 rnd(time(0));


constexpr int N=1231564;

struct tree_array{           //树状数组 0号位置始终为0；     
    int n;vector<int> array;
    tree_array(int n):array(n+1),n(n){}
    void add(int pos,int x){        //单点修改       //O(logn)
        for(;pos<=n;pos+=lowbit(pos))
            array[pos]+=x; //维护信息 要根据维护的信息特点
    }
    int ask(int pos){    //获取0……pos的信息
        int ans=0;          //O(logn)
        for(;pos;pos-=lowbit(pos))
            ans+=array[pos];         //要根据维护信息修改
        return ans;
    }
};


inline void solve(){
    double n,m;cin>>n>>m;
    if(n==2)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                if(j==m)cout<<1<<"\n";
                else cout<<0<<" ";
            }
        }
    }
    else if(n>=m*2-1 || n>=m && n<m*2-2)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                if(i%(int)m==j%(int)m)cout<<1<<" ";
                else cout<<0<<" ";
            }
            cout<<"\n";
        }
    }
	else if(n==2*m-2)
	{
		for(int i=1;i<=n;i++)
		{
			if(i==m-1 || i==m)
			{
				for(int j=1;j<=m;j++)
				{
					if(j==m-1 || j==m)
					{
						cout<<0.5<<" ";
					}
					else cout<<0<<' ';
				}
			}
			else
			{
				for(int j=1;j<=m;j++)
				{
					if(i%(int)m==j%(int)m)cout<<1<<' ';
					else cout<<0<<" ";
				}
			}
			cout<<"\n";
		}
	}
    else
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                if(i==m+1-j)cout<<1<<" ";
                else cout<<0<<" ";
            }
            cout<<"\n";
        }
    }
}





signed main()
{
    //freopen("E:\\work_tool\\document\\data\\input.in", "r", stdin);
    //freopen("E:\\work_tool\\document\\data\\output.out", "w", stdout);
    ios::sync_with_stdio(false);
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);    //关闭同步  如果使用 则不要使用<cstdio>
    cout << fixed << setprecision(10);
    int T=1;
    //cin>>T;
    while(T--){
        solve();
    }
    return 0;
}