#include <bits/stdc++.h>

using namespace std;

int main() {
    long long r, c;
    cin >> r >> c; // r - n, c - m
    int md = 1e9;
    int bx, by, bp, bits;
    for (int p = 0; p < c; ++p) {
    	long long left = 0, right = r - 1;
    	int its = 0;
    	while (1) {
    		long long n_left = (p * r + left) / c;
    		long long n_right = (p * r + right) / c;
    		if (n_right - n_left == right - left) break;
    		++its;
    		left = n_left;
    		right = n_right;
		}
		if (left < right) continue;
		int x =  (p * r + left) / c, y = (p * r + left) % c;
		int dx = min(abs(x - r / 2), abs(x - (r - 1) / 2));
		int dy = min(abs(y - c / 2), abs(y - (c - 1) / 2));
		int d = dx + dy;
		if (make_pair(d, p) < make_pair(md, bp)) {
			md = d;
			bx = x;
			by = y;
			bp = p;
			bits = its;
		}
	}
	cout << bp + 1 << " " << bx + 1 << " " << by + 1 << " " << bits + 1 << "\n";
    return 0;
}