//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int nxt[1001000];
vector<int> G[1001000];
int dist[1001000];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int r,c;
	cin>>r>>c;
	int p=-1,ax=-1,ay=-1,s=-1;
	int d=0x3f3f3f3f;
	for(int i=1;i<=c;i++)
	{
		// (x-1)*m+y=x+(i-1)*r
		// (m-1)x=(i-1)*r+m-y
		int rem=(1ll*(i-1)*r+c)%(c-1);
		if(rem==1&&(1ll*(i-1)*r+c-rem)/(c-1)>1) continue;
		int y=rem;
		if(!y) y+=c-1;
		int x=(1ll*(i-1)*r+c-y)/(c-1);
		if(x<1||x>r||y<1||y>c) continue;
		int dist=0x3f3f3f3f;
		for(int j=(r+1)/2;j<=r/2+1;j++)
			for(int k=(c+1)/2;k<=c/2+1;k++)
				dist=min(dist,abs(j-x)+abs(k-y));
		if(dist<d)
		{
			d=dist;
			p=i;
			ax=x;
			ay=y;
		}
	}
	for(int i=1;i<=r;i++)
	{
		ll val=1ll*(p-1)*r+i;
		nxt[i]=(val+c-1)/c;
		if(i!=nxt[i])
			G[nxt[i]].pb(i);
	}
	memset(dist,-1,sizeof(dist));
	queue<int> q;
	for(int i=1;i<=r;i++)
		if(i==nxt[i])
		{
			dist[i]=0;
			q.push(i);
		}
	while(!q.empty())
	{
		int x=q.front();
		q.pop();
		for(auto y:G[x])
		{
			dist[y]=dist[x]+1;
			q.push(y);
		}
	}
	cout<<p<<" "<<ax<<" "<<ay<<" "<<*max_element(dist+1,dist+r+1)+1<<endl;
	return 0;
}