#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int r,c,nx[N],D[N],dp[N];
inline int dis(int X,int Y){return max(X+1,r-X)+max(Y+1,c-Y);}
int main()
{
	cin>>r>>c;
	int mn=1e9,P=1,_I,_J,S=0;
	long long Z=0;
	for(int p=0;p<c;++p,Z+=r)
	{
		int I=Z/(c-1);
		int J=(Z+I)%c;
		if(I&&!J)continue;
		int w=dis(I,J);
		if(mn>w)mn=w,P=p,_I=I,_J=J;
	}
	for(int i=0;i<r;++i)nx[i]=(1ll*P*r+i)/c,D[nx[i]]+=i!=nx[i];
	queue<int>Q;for(int i=0;i<r;++i)if(!D[i])Q.push(i);
	while(!Q.empty())
	{
		int u=Q.front();Q.pop();S=max(S,dp[u]);
		int v=nx[u];if(!--D[v])dp[v]=dp[u]+1,Q.push(v);
	}
	cout<<P+1<<" "<<_I+1<<" "<<_J+1<<" "<<S+1<<endl;
}