// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops", "omit-frame-pointer", "inline")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma,tune=native")
// #pragma GCC option("arch=native", "no-zero-upper") // Enable AVX

/// UH Top
#include <bits/stdc++.h>
#define db(x) cerr << #x << ':' << (x) << '\n';
#define all(v) (v).begin(), (v).end()
#define allr(v) (v).rbegin(), (v).rend()
#define int ll
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
// typedef __int128_t int128;
typedef pair<ll, ll> pii;
typedef pair<ld, ll> pdi;
typedef pair<ld, ld> pdd;
typedef pair<ld, pdd> pdp;
typedef pair<string, ll> psi;
typedef pair<ll, string> pls;
typedef pair<string, string> pss;
typedef pair<ll, pii> pip;
typedef pair<pii, pii> ppp;
typedef complex<ld> point;
typedef vector<point> polygon;
typedef vector<ll> vi;
typedef pair<point, int> ppi;
#define prec(n)        \
    cout.precision(n); \
    cout << fixed
const ll mod = (1e9 + 7);
const ld eps = (1e-9);
const ll oo = (ll)(1e18 + 5);
#define pi acos(-1)
#define MAXN (ll)(1e6 + 5)

int dist(pii x,vector<pii>& center)
{
    ll ans=1e18;
    for(auto p : center)
        ans=min(ans,abs(p.first-x.first)+abs(p.second-x.second));
    return ans;
}

pii next(int r,int c,int p,int i,int j)
{
    int p1=(p-1)*r+i-1;
    int jp=p1%c+1;
    int ip=p1/c+1;
    return pii(ip,jp);
}

int calc_s(pii ini,int r,int c,int p,pii fin)
{
    int ans=0;
    while(ini!=fin)
    {
        ini=next(r,c,p,ini.first,ini.second);
        ans++;
    }
    return ans;
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll r,c;
    cin >> r >> c;
    int best=1e9;
    pii ij=pii(-1,-1);
    int p,s;
    vector<pii> center;
    for(int i=r/2+(r&1);i<=r/2+1;i++)
        for(int j=c/2+(c&1);j<=c/2+1;j++)
            center.push_back(pii(i,j));
    for(int px=1;px<=c;px++)
    {
        int i,j;
        if(px==1)
        {
            i=1,j=1;
        }
        else if(px==c)
        {
            i=r,j=c;
        }
        else
        {
            ll mul=(px-1)*r;
            if(mul%(c-1)==0)
                continue;
            j=(mul%(c-1))+1;
            i=(mul/(c-1))+1;
        }
        int ss=max(calc_s(pii(1,1),r,c,px,pii(i,j)),calc_s(pii(r,c),r,c,px,pii(i,j)));
        if(dist(pii(i,j),center)<best)
        {
            best=dist(pii(i,j),center);
            ij=pii(i,j);
            p=px;
            s=ss;
        }
    }
    cout << p << ' ' << ij.first << ' ' << ij.second << ' ' << s << '\n';

    return 0;
}