#include <iostream>

 #include <cstdio>

 #include <cstdlib>

 #include <cstring>

 #include <cmath>

 #include <cctype>

 #include <algorithm>

 #include <queue>

 #include <deque>

 #include <queue>

 #include <list>

 #include <map>

 #include <set>

 #include <vector>

 #include <utility>

 #include <functional>

 #include <fstream>

 #include <iomanip>

 #include <sstream>

 #include <numeric>

 #include <cassert>

 #include <ctime>

 #include <iterator>

 const int INF = 0x3f3f3f3f;

 const int dir[][] = {{-,},{,},{,-},{,},{-,-},{-,},{,-},{,}};

 using namespace std;

 int sad[], fun[][];

 int main(void)

 {

     int n, m;

     while (~scanf("%d%d",&n,&m))

     {

         for(int i=;i<=n;++i)

         {

             sad[i]=m/n;

             if(i<=m%n) sad[i]++;

         }

         int row=;

         for(int i=;i<=n;++i)

         {

             int k=n;

             for(int j=;j<=sad[i];++j)

             {

                 while (i==k||k==)

                 {if(i==k) k--;

                 if(k==) k=n;}

                 fun[row][]=i;

                 fun[row][]=k;

                 k--; row++;

             }

         }

         for(int i=;i<=m;++i)

         {

             printf("%d %d",fun[i][],fun[i][]);

             for(int j=;j<=n;++j)

             {

                 if(j!=fun[i][]&&j!=fun[i][]) printf(" %d",j);

             }

             printf("\n");

         }

     }

     return ;

 }