#include <bits/stdc++.h>
using namespace std;
vector<string> solve(vector<string>& chain, vector<string>& elements) {
    unordered_map<string, int> required, window;
    for (const auto& elem : elements) {
        required[elem]++;
    }
    int requiredSize = required.size();
    int have = 0;
    int left = 0, right = 0;
    int minLength = INT_MAX;
    int start = -1;
    while (right < chain.size()) {
        string rightElem = chain[right];
        if (required.count(rightElem)) {
            window[rightElem]++;
            if (window[rightElem] == required[rightElem]) {
                have++;
            }
        }
        while (have == requiredSize) {
            if (right - left + 1 < minLength) {
                minLength = right - left + 1;
                start = left;
            }
            string leftElem = chain[left];
            if (required.count(leftElem)) {
                window[leftElem]--;
                if (window[leftElem] < required[leftElem]) {
                    have--;
                }
            }
            left++;
        }
        right++;
    }
    if (start == -1) {
        return {};
    }
    return vector<string>(chain.begin() + start, chain.begin() + start + minLength);
}

#include <bits/stdc++.h>
using namespace std;
void f(int i,int m,int down, int power,int& ans){
    if (i > m+2) return;
    if (i < 0) return;
    if(i == m) ans++;
    f(i+pow(2,power),m,1,power+1,ans);
    if (down)
    {
        f(i-1,m,0,power,ans);
    }
}

int solve(int m){
    int ans = 0;
    f(1,m,1,0,ans);
    return ans;
}

#include <bits/stdc++.h>
#define ll long long  
using namespace std;     
signed main() 
{
     ll sz,n; cin>>sz>>n;
     vector<ll>a(n);
     for(ll i=0;i<n;i++) cin>>a[i];
     vector<vector<ll>>ans;
     for(ll i=0;i<sz-1;i++) a.insert(a.begin(),0);
     reverse(a.begin(),a.end());
     for(ll i=0;i<n;i++)
     {  
        vector<ll>curr;
        for(ll j=i;j<i+sz;j++) curr.push_back(a[j]);
        ans.push_back(curr);
     }
      reverse(ans.begin(),ans.end());
      for(ll i=0;i<ans.size();i++)
      {
        for(ll j=0;j<ans[i].size();j++) cout<<ans[i][j]<<" ";
        cout<<endl;
      }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
vector<int> ttl_cache(int n, vector<vector<int>> entries, vector<int> queries){
    int q = queries.size();

    vector<pair<int,int>> arr;
    for(int i=0;i<q;i++){
        arr.push_back({queries[i],i});
    }
    sort(arr.begin(),arr.end());

    vector<int> res(q);
    pbds st;

    int i=0;
    int x = arr[i].first;
    sort(entries.begin(), entries.end());
    for(auto &v:entries){
        while(v[0]>x){
            res[arr[i].second] = st.size() - st.order_of_key(x);
            i++;
            if(i==q) return res;
            x = arr[i].first;
        }
        st.insert(v[0]+v[1]);
    }

    for(;i<q;i++){
        x = arr[i].first;
        res[arr[i].second] = st.size() - st.order_of_key(x);
    }
    return res;
}