#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl

using namespace std;

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}};
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;

const int MAX_N = 100005;

vi ans[38][38];
int sm[1407];
int cnt[1407];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, K;
    n = 1407, K = 38;
    cout << n << " " << K << "\n";
    // K
    rep(j,K){
        ans[0][0].pb(j+1);
    }
    // K*(K-1)
    rep(i,K){
        rep(j,K-1){
            ans[i][j+(i==0)].pb(i+1);
        }
    }
    // (K-1)*(K-1)*K
    srep(j,1,K){
        rep(k,K-1){
            ans[0][j].pb((K-1)*j+k+2);
            int val = ans[0][j].back();
            int tm = 0;
            rep(l,K-1){
                tm = (tm + j) % (K-1);
                ans[l+1][(tm + k) % (K-1)].pb(val);
            }
        }
    }
    rep(i,K){
        rep(j,K-1+(i==0)){
            assert(len(ans[i][j]) == K);
        }
    }
    // rep(i,K){
    //     rep(j,K-1+(i==0)){
    //         rep(k,K){
    //             rep(l,K-1+(k==0)){
    //                 if(k == i && l == j) continue;
    //                 rep(m,n) cnt[m] = 0;
    //                 rep(m, K){
    //                     cnt[ans[i][j][m]-1]++, cnt[ans[k][l][m]-1]++;
    //                 }
    //                 bool flag = false;
    //                 rep(m,n){
    //                     if(cnt[m] == 2){
    //                         assert(!flag);
    //                         flag = true;
    //                     }else if(cnt[m] > 2){
    //                         assert(false);
    //                     }
    //                 }
    //             }
    //         }
    //     }
    // }
    rep(i,K){
        rep(j,K-1+(i==0)){
            rep(k,K){
                sm[ans[i][j][k]-1]++;
                cout << ans[i][j][k] << " ";
            }
            cout << "\n";
        }
    }
    rep(i,n) assert(sm[i] == K);
    return 0;
}


Measured memory_bytes: 896