#include <iostream>
#include <vector>
#include <cassert>
using namespace std;

int sum(const vector<int>& t) {
    int res = 0;
    for (int x : t) {
        res += x;
    }
    return res;
}

void construct(int N, int M, vector<int>& a, vector<int>& b, vector<int>& c, vector<int>& d) {
    for (int i = 0; i < N - 1; ++i) {
        a.push_back(1);
        b.push_back(3);
    }
    a.push_back(M - 3 * (N - 1) - 1);
    b.push_back(M - 3 * (N - 1));
    
    int denom = M - 1 - 2 * (N - 2);
    int numer = 0;
    while (3 * numer <= denom) {
        numer++;
    }
    
    c.push_back(numer);
    d.push_back(denom);
    
    for (int i = 0; i < N - 2; ++i) {
        c.push_back(1);
        d.push_back(2);
    }
    c.push_back(1);
    d.push_back(1);
}

int main() {
    int N, M;
    cin >> N >> M;

    vector<int> a, b, c, d;
    construct(N, M, a, b, c, d);
    
    for (int i = 0; i < N; ++i) {
        cout << c[i] << " " << d[i] << " " << a[i] << " " << b[i] << endl;
    }

    return 0;
}