Tinkof

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int,int>
#define vec vector
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvl(vector <ll> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}


void cvv(vector <vector <int> > &v){
    for (auto x: v) cv(x);
    cout<<"\n";
}

void cvb(vector <bool> v){
    for (bool x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvs(vector <string>  v){
    for (auto a: v){
        cout<<a<<"\n";
    }
}

void cvp(vector <pii> a){
    for (auto p: a){
        cout<<p.first<<' '<<p.second<<"\n";
    }
    cout<<"\n";
}



int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n=100, m;
    vector <vector <int> > v(n, vector <int> (n));
    int k = 0;
    for (int i=0;i<n;++i){
        k =  (k + 1) % 5;
        if (k == 0) k = 5;
        v[0][i] = k;
    }
    for (int i = 1; i < n; ++i){
        k = v[i - 1][2] - 1;
        for (int j = 0; j < n; ++j){
            k = (k + 1) % 5;
            if (k == 0) k = 5;
            v[i][j] = k;
        }
    }
    cin>>n>>m;
    for (int i = 0; i < n; ++i){
        for (int j = 0; j < m; ++j){
            cout<<v[i][j]<<' ';
        }cout<<"\n";
    }
}