#include <bits/stdc++.h>

using namespace std;

#define REP(i, a, b) for (int i = (a), i##_end_ = (b); i < i##_end_; ++i)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define mp make_pair
#define x first
#define y second
#define pb emplace_back
#define SZ(x) (int((x).size()))
#define ALL(x) (x).begin(), (x).end()

template<typename T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template<typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

typedef long long LL;

const int oo = 0x3f3f3f3f;

int n, m;

vector<pair<int, int> > centers;

struct answer
{
	int p, x, y, s;

	answer(): p(-1), x(0), y(0), s(0) { }
	answer(int _p, int _x, int _y, int _s): p(_p), x(_x), y(_y), s(_s) { }

	inline int dis() const
	{
		if (!~p) return oo;
		int ret = oo;
		for (auto u : centers)
			chkmin(ret, abs(x - u.x) + abs(y - u.y));
		return ret;
	}

	friend inline bool operator<(const answer &x, const answer &y)
	{
		int xd = x.dis(), yd = y.dis();
		if (xd != yd) return xd < yd;
		return x.p < y.p;
	}
};

answer work(int x)
{
	LL l = 0, r = (LL)n * m - 1; 
	for (int i = 0; ; ++i)
	{
		if (r - l == 1 && l / m != r / m) return answer();
		if (r - l == 0) return answer(x, l / m, l % m, i);
		l = l / m + (LL)x * n;
		r = r / m + (LL)x * n;
	}
}

int main()
{
#ifdef LOCAL
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	scanf("%d%d", &n, &m);
	REP(i, (n - 1) >> 1, (n >> 1) + 1) REP(j, (m - 1) >> 1, (m >> 1) + 1)
		centers.pb(mp(i, j));
	answer ans;
	REP(i, 0, m)
	{
		answer tmp = work(i);
		chkmin(ans, tmp);
	}
	printf("%d %d %d %d\n", ans.p + 1, ans.x + 1, ans.y + 1, ans.s);
	return 0;
}