#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i=0;i<(long long)(n);i++)
#define all(v) v.begin(),v.end()
using ll=long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
const ll INF=(1ll<<60);
template<class T> void chmin(T &a,T b){
    if(a>b){
        a=b;
    }
}
template<class T> void chmax(T &a,T b){
    if(a<b){
        a=b;
    }
}
ll n,k;
ll score(vector<ll> &t,vector<ll> &u,vector<ll> &ans){
    double p=0;
    rep(i,k){
        double now=0;
        vector<ll> x(n);
        rep(ii,n){
            ll a=(t[i]-(ans[ii]+1))/(ans[ii]*2);
            ll b=(t[i]-(ans[ii]+1))%(ans[ii]*2);
            if(a%2==0){
                x[ii]=ans[ii]-1-b;
            }else{
                x[ii]=-ans[ii]+1+b;
            }
        }
        rep(ii,n-1){
            for(ll jj=ii+1;jj<n;jj++){
                now+=(double)abs(x[ii]-x[jj])/(double)(ans[ii]+ans[jj]);
            }
        }
        p+=2e7/((double)n*(n-1))*now;
    }
    double q=0;
    rep(i,k){
        double now=0;
        vector<ll> x(n);
        rep(ii,n){
            ll a=(t[i]-(ans[ii]+1))/(ans[ii]*2);
            ll b=(t[i]-(ans[ii]+1))%(ans[ii]*2);
            if(a%2==0){
                x[ii]=ans[ii]-1-b;
            }else{
                x[ii]=-ans[ii]+1+b;
            }
        }
        rep(ii,n-1){
            for(ll jj=ii+1;jj<n;jj++){
                chmax(now,(double)abs(x[ii]-x[jj]));
            }
        }
        q+=1e7/sqrt(now/20+1);
    }
    ll ret=(ll)(p/k)*(ll)(q/k);
    return ret;
}
int main(){
    srand((unsigned int)time(NULL));
    double start=clock();
    cin >> n >> k;
    vector<ll> t(k),u(k);
    rep(i,k) cin >> t[i];
    rep(i,k) cin >> u[i];
    ll xxx=n;
    vector<ll> ans(n,xxx);
    ll max_score=score(t,u,ans);
    mt19937 mt(rand());
    double time_limit=1.91;
    while(true){
        double now=clock();
        if(time_limit<(now-start)/CLOCKS_PER_SEC) break;
        ll x=mt()%n;
        ll h=ans[x];
        ans[x]=mt()%(xxx-1)+1;
        ll now_score=score(t,u,ans);
        double now_second=now/CLOCKS_PER_SEC;
        double start_second=start/CLOCKS_PER_SEC;
        double temp=1000-900*(now_second-start_second)/time_limit;
        double prob=exp((now_score-max_score)/temp);
        if(1.0*(double)mt()/(double)(1ll<<32)<prob){
            max_score=now_score;
        }else{
            ans[x]=h;
        }
    }
    rep(i,n){
        cout << ans[i] << " " << ans[i] << " " << 1 << endl;
    }
}