#include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using tii=tuple<int,int,int>;
using qii=tuple<int,int,int,int>;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
constexpr int INF=1e9;
constexpr ll INF_ll=1e18;
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define replr(i,l,r) for (int i=(int)(l);i<(int)(r);i++)
#define all(v) v.begin(),v.end()
#define len(v) ((int)v.size())
template<class T> inline bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T &a,T b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}

template<class T> inline bool chmin_ref(T &a,const T &b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax_ref(T &a,const T &b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}

namespace Timer{
    chrono::steady_clock::time_point program_start,start;
    void program_start_snap(){
        program_start=start=chrono::steady_clock::now();
    }
    void snap(){
        start=chrono::steady_clock::now();
    }
    int get_ms(){
        auto now=chrono::steady_clock::now();
        int ms=chrono::duration_cast<chrono::milliseconds>(now-start).count();
        return ms;
    }
    int get_ms_all_program(){
        auto now=chrono::steady_clock::now();
        int ms=chrono::duration_cast<chrono::milliseconds>(now-program_start).count();
        return ms;
    }
}

mt19937 mt;
uint32_t rand_int(uint32_t r){  //[0,r)
    assert(r!=0);
    return ((uint64_t)mt()*r)>>32;
}
int rand_int(int l,int r){  //[l,r)
    assert(l<r);
    return l+rand_int(r-l);
}
constexpr double one_div_mt_max=1.0/(double)mt19937::max();
double rand_double(){  //[0.0,1.0]
    return mt()*one_div_mt_max;
}
double rand_double(double l,double r){  //[l,r]
    return l+rand_double()*(r-l);
}
template<class T> T get_random_element(const vector<T> &v){
    assert(!v.empty());
    return v[rand_int(len(v))];
}

template<class T> void add(vector<T> &a,vector<T> b){
    for(auto i:b) a.push_back(i);
}

template<class SA_State,int limit_ms,double start_temp,double end_temp=0.0> SA_State SA(const SA_State &first_state){

    SA_State state=first_state,best_state=state;
    

    
    int loop_cnt=0,accept_cnt=0,update_cnt=0;
    
    int ms=0;
    
    double temp=start_temp;
    
    Timer::snap();
    
    
    while(true){

        if(true){
            
            ms=Timer::get_ms();
            
            if(limit_ms<=ms) break;
            
            //double t=(double)ms/limit_ms;
            
            temp=start_temp-(start_temp-end_temp)/limit_ms*ms;
            //temp=pow(start_temp,1-t)*pow(end_temp,t);
            
        }
        
        loop_cnt++;
        
        
        double accept_diff=log(rand_double())*temp;
        

        bool accepted=state.modify(accept_diff);
        
        if(accepted){
            
            accept_cnt++;
        
            if(best_state.score<state.score){
                best_state=state;
                cerr << "score:" << best_state.score << " ms:" << ms << " loop_cnt:" << loop_cnt << " accept_cnt:" << accept_cnt << " update_cnt:" << update_cnt << '\n';
                update_cnt++;
            }
        }
    }

    
    cerr << "[result] " << "score:" << best_state.score << " ms:" << ms << " loop_cnt:" << loop_cnt << " accept_cnt:" << accept_cnt << " update_cnt:" << update_cnt << '\n';
    
    return best_state;
};

constexpr int N=14,K=3000,T=400,M=1000000;
array<int,K> A,B;

array<array<int,4>,N*N> G;
vector<pii> E;

int one(int i,int j){
    return i*N+j;
}
pii two(int x){
    return {x/N,x%N};
}

int calc_income(const vector<pii> &edges){
    
    set<pii> st(all(edges));
    
    array<array<pii,4>,N*N> g;
    
    rep(i,N*N){
        rep(k,4){
            if(G[i][k]==-1){
                g[i][k]={-1,INF};
            }else{
                if(st.contains({i,G[i][k]})||st.contains({G[i][k],i})){
                    g[i][k]={G[i][k],223};
                    
                }else{
                    g[i][k]={G[i][k],1000};
                }
            }
        }
    }
    
    
    array<array<int,N*N>,N*N> dist;
    array<array<int,N*N>,N*N> cnt;
    
    rep(i,N*N){
        
        dist[i].fill(INF);
        cnt[i].fill(0);
        priority_queue<pii,vector<pii>,greater<pii>> pq;
        dist[i][i]=0;
        pq.push({0,i});
        
        while(!pq.empty()){
            auto [d,x]=pq.top();
            pq.pop();
            
            if(dist[i][x]!=d) continue;
            
            for(auto [y,c]:g[x]){
                
                if(y==-1) continue;
                
                if(chmin(dist[i][y],dist[i][x]+c)){
                    cnt[i][y]=cnt[i][x]+(c==223);
                    pq.push({dist[i][y],y});
                }
            }
        }
    }
    
    int sum=0;
    
    rep(i,K){
        sum+=cnt[A[i]][B[i]];
    }
    
    
    
    return 60*sum;
}

namespace Solver{
    
    array<array<int,N*N>,N*N> start_dist;
    array<array<int,N*N>,N*N> start_cnt;
    
    struct State{
        
        vector<pii> edges;
        
        int score=0;
        
        State(){
            
            rep(i,N-1) edges.emplace_back(one(N/2,i),one(N/2,i+1));
            rep(i,N-1) edges.emplace_back(one(i,N/2),one(i+1,N/2));
            
            score=get_score();
        }
        
        
        int get_score(){
            
            int sz=len(edges);
            
            vector<int> income;
            
            income.push_back(0);
            
            auto dist=start_dist;
            auto cnt=start_cnt;
            
            
            for(auto [u,v]:edges){
                
                rep(i,N*N){
                    rep(j,N*N){
                        if(chmin(dist[i][j],dist[i][u]+223+dist[v][j])) cnt[i][j]=cnt[i][u]+1+cnt[v][j];
                        if(chmin(dist[i][j],dist[i][v]+223+dist[u][j])) cnt[i][j]=cnt[i][v]+1+cnt[u][j];
                    }
                }
                
                int sum=0;
    
                rep(i,K){
                    sum+=cnt[A[i]][B[i]];
                }
                
                income.push_back(sum*60);
                
            }
            
            int turn=0,money=M,people=1;
            
            
            rep(k,sz){
                
                //cerr << turn << " : " << money << " " << people << endl;
                
                
                int best_turn=INF,add_people=0;
                
                replr(p,people,T+2){
                    
                    int now_add_people=p-people;
                    
                    int cost=floor((double)1e7/sqrt(p));
                    
                    int need_turn=now_add_people+(max(0,cost-money+income[k]*now_add_people)+(50000+income[k])-1)/(50000+income[k])+1;
                    
                    
                    if(chmin(best_turn,need_turn)){
                        add_people=now_add_people;
                    }
                }
                
                
                if(T<=turn+best_turn) return 0;
                
                turn+=best_turn;
                
                money+=income[k]*add_people;
                people+=add_people;
                money+=(50000+income[k])*(best_turn-1-add_people);
                
                
                money-=(int)floor((double)1e7/sqrt(people));
                
                assert(0<=money);
                
                money+=income[k+1];
            }
            
            
            
            money+=(T-turn)*(50000+income[sz]);
            
            //cerr << money << endl;
            
            return money;
        }
        
        void output_ans(){
            
            int sz=len(edges);
            
            vector<int> income;
            
            income.push_back(0);
            
            auto dist=start_dist;
            auto cnt=start_cnt;
            
            
            for(auto [u,v]:edges){
                
                rep(i,N*N){
                    rep(j,N*N){
                        if(chmin(dist[i][j],dist[i][u]+223+dist[v][j])) cnt[i][j]=cnt[i][u]+1+cnt[v][j];
                        if(chmin(dist[i][j],dist[i][v]+223+dist[u][j])) cnt[i][j]=cnt[i][v]+1+cnt[u][j];
                    }
                }
                
                int sum=0;
    
                rep(i,K){
                    sum+=cnt[A[i]][B[i]];
                }
                
                income.push_back(sum*60);
                
            }
            
            vector<vector<vector<int>>> dp(T+1,vector<vector<int>>(T+2,vector<int>(sz+1,-INF)));  //[turn][協力者数][進行度]=所持金
            vector<vector<vector<tii>>> pre(T+1,vector<vector<tii>>(T+2,vector<tii>(sz+1,{-1,-1,-1})));
            
            
            dp[0][1][0]=M;
            
            rep(t,T){
                rep(i,T+2){
                    int cost=floor(1e7/sqrt(i));
                    rep(k,sz+1){
                        
                        if(dp[t][i][k]<0) continue;
                        
                        
                        if(k+1<=sz&&cost<=dp[t][i][k]){
                            if(chmax(dp[t+1][i][k+1],dp[t][i][k]-cost+income[k+1])){
                                pre[t+1][i][k+1]={t,i,k};
                            }
                        }
                        
                        if(i+1<T+2){
                            if(chmax(dp[t+1][i+1][k],dp[t][i][k]+income[k])){
                                pre[t+1][i+1][k]={t,i,k};
                            }
                        }
                        if(chmax(dp[t+1][i][k],dp[t][i][k]+50000+income[k])){
                            pre[t+1][i][k]={t,i,k};
                        }
                    }
                }
            }
            
            int best_score=0;
            
            int nt=-1,ni=-1,nk=-1;
            
            rep(i,T+2){
                replr(k,sz,sz+1){
                    if(chmax(best_score,dp[T][i][k])){
                        nt=T;
                        ni=i;
                        nk=k;
                    }
                }
            }
            
            cerr << best_score << endl;
            
            vector<tii> ans;
            
            vector<int> income_v;
            
            while(0<=nt){
                auto [pt,pi,pk]=pre[nt][ni][nk];
                
                
                if(pt==-1) break;
                
                
                if(pk!=nk) ans.emplace_back(1,edges[pk].first,edges[pk].second);
                else if(pi!=ni) ans.emplace_back(2,-1,-1);
                else ans.emplace_back(3,-1,-1);
                
                
                
                nt=pt;
                ni=pi;
                nk=pk;
                
                income_v.push_back(dp[nt][ni][nk]);
            }
            
            reverse(all(ans));
            reverse(all(income_v));
            
            assert(len(ans)==T);
            
            int idx=0;
            
            for(auto [t,u,v]:ans){
                
                int x,y;
                cin >> x >> y;
                
                //assert(income_v[idx]==x);
                
                if(t==1){
                    auto [a,b]=two(u);
                    auto [c,d]=two(v);
                    cout << "1 " << a+1 << ' ' << b+1 << ' ' << c+1 << ' ' << d+1 << '\n';
                    cout.flush();
                }else{
                    cout << t << '\n';
                    cout.flush();
                }
                
                idx++;
            }
            
        }
        
        bool modify(double accept_diff){
            auto pre_edges=edges;
            
            int r=rand_int(3);
            
            if(r==0||edges.empty()){
                edges.insert(edges.begin()+rand_int(len(pre_edges)+1),get_random_element(E));
            }else if(r==1){
                edges.erase(edges.begin()+rand_int(len(pre_edges)));
            }else if(r==2){
                swap(edges[rand_int(len(pre_edges))],edges[rand_int(len(pre_edges))]);
            }/*else{
                edges[rand_int(len(pre_edges))]=get_random_element(E);
            }*/
            
            int new_score=get_score();
            
            //cerr << score << " " << new_score << endl;
            
            if(accept_diff<=new_score-score){
                score=new_score;
                return true;
            }else{
                edges=pre_edges;
                return false;
            }
            
        }
        
    };
    
    void init(){
        
        
        rep(i,N*N){
            
            start_dist[i].fill(INF);
            start_cnt[i].fill(0);
            priority_queue<pii,vector<pii>,greater<pii>> pq;
            start_dist[i][i]=0;
            pq.push({0,i});
            
            while(!pq.empty()){
                auto [d,x]=pq.top();
                pq.pop();
                
                if(start_dist[i][x]!=d) continue;
                
                for(auto y:G[x]){
                    
                    if(y==-1) continue;
                    
                    if(chmin(start_dist[i][y],start_dist[i][x]+1000)){
                        pq.push({start_dist[i][y],y});
                    }
                }
            }
        }
    }
    
    void solve(){
        
        init();
        
        
        State state;
        state=SA<State,1800,0.>(state);
        state.output_ans();
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    Timer::program_start_snap();
    
    int k,t;
    cin >> k >> t;
    assert(k==K);
    assert(t==T);
    
    A.fill(-1);
    B.fill(-1);
    
    rep(i,K){
        int a,b,c,d;
        cin >> a >> b >> c >> d;
        a--;
        b--;
        c--;
        d--;
        A[i]=one(a,b);
        B[i]=one(c,d);
        
    }
    
    rep(i,N*N) G[i].fill(-1);
    
    rep(i,N){
        rep(j,N){
            if(j+1<N){
                G[one(i,j)][3]=one(i,j+1);
                G[one(i,j+1)][2]=one(i,j);
                E.emplace_back(one(i,j),one(i,j+1));
            }
            if(i+1<N){
                G[one(i,j)][1]=one(i+1,j);
                G[one(i+1,j)][0]=one(i,j);
                E.emplace_back(one(i,j),one(i+1,j));
            }
        }
    }

    Solver::solve();
    exit(0);
}