#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

/*
int n,m,a[55][55];
int cnt[55][55],mx[55][55];

void solve(){
    cin >> n >> m;
    for(int p = 1;p <= m;p ++){
        memset(cnt,0,sizeof(cnt));
        memset(mx,0,sizeof(mx));
        set <int> st;
        for(int x = 1;x <= n * m;x ++){
            int tot = 0;
            for(int i = 1;i <= n;i ++){
                for(int j = 1;j <= m;j ++){
                    a[i][j] = ++ tot;
                }
            }
            int posx,posy;
            for(int i = 1;i <= n;i ++){
                for(int j = 1;j <= m;j ++){
                    if(a[i][j] == x) posx = i,posy = j;
                }
            }
            vector <pair <int,int> > G;
            G.push_back({posx,posy});
            int fl = 0;
            for(int ti = 1;ti <= 1000;ti ++){
                vector <int> lis,H;
                for(int j = 1;j <= m;j ++){
                    if(j == posy) continue;
                    for(int i = 1;i <= n;i ++) lis.push_back(a[i][j]);
                }
                for(int i = 0;i < (p - 1) * n;i ++) H.push_back(lis[i]);
                for(int i = 1;i <= n;i ++) H.push_back(a[i][posy]);
                for(int i = (p - 1) * n;i < lis.size();i ++) H.push_back(lis[i]);
                int cur = 0;
                for(int i = 1;i <= n;i ++){
                    for(int j = 1;j <= m;j ++){
                        a[i][j] = H[cur ++];
                        if(a[i][j] == x) posx = i,posy = j;
                    }
                }
                if(make_pair(posx,posy) == G.back()){
                    fl = 1; break;
                }
                G.push_back({posx,posy});
            }
            if(fl){
                // cout << "P = " << p << ", Gsize = " << G.size() << '\n';
                // for(auto [x,y] : G) cout << x << ',' << y << ' ';
                // cout << '\n';
                auto [x,y] = G.back();
                cnt[x][y] ++;
                mx[x][y] = max(mx[x][y],(int)(G.size()) - 1);
                cout << (G.size() - 1) << ',';
            }
        }
        cout << '\n';
        for(int i = 1;i <= n;i ++){
            for(int j = 1;j <= m;j ++){
                if(cnt[i][j] == n * m){
                    cout << i << ',' << j << ' ' << mx[i][j] << " P = " << p << '\n';
                }
            }
        }
    }
}
*/

#define int long long

struct node{
    int dis,p,x,y;
    bool operator < (const node &nd)const{
        if(dis == nd.dis) return p < nd.p;
        return dis < nd.dis;
    }
};

inline int calcc(int xa,int ya,int xb,int yb){ return abs(xa - xb) + abs(ya - yb); }
int calcd(int n,int m,int x,int y){
    return min({calcc(x,y,(n + 1) / 2,(m + 1) / 2),calcc(x,y,(n + 1) / 2,m / 2 + 1),calcc(x,y,n / 2 + 1,(m + 1) / 2),calcc(x,y,n / 2 + 1,m / 2 + 1)});
}

int runc(int sx,int sy,int tx,int ty,int p,int n,int m){
    for(int ti = 1;;ti ++){
        if(sx == tx && sy == ty) return ti - 1;
        int pos = (p - 1) * n + (sx - 1);
        sx = pos / m + 1; sy = pos % m + 1;
    }
}

void solve(){
    int n,m; cin >> n >> m;
    node ans = min((node){calcd(n,m,1,1),1,1,1},(node){calcd(n,m,n,m),m,n,m});
    for(int p = 2;p < m;p ++){
        int val = (p - 1) * n;
        int x = val / (m - 1) + 1,y = val % (m - 1) + 1;
        if(y != 1){
            ans = min(ans,{calcd(n,m,x,y),p,x,y});
        }
    }
    int stp = runc(1,1,ans.x,ans.y,ans.p,n,m);
    stp = max(stp,runc(n,m,ans.x,ans.y,ans.p,n,m));
    stp = max(stp,runc(1,m,ans.x,ans.y,ans.p,n,m));
    stp = max(stp,runc(n,1,ans.x,ans.y,ans.p,n,m));
    cout << ans.p << ' ' << ans.x << ' ' << ans.y << ' ' << stp << '\n';
}

signed main(){
    ios::sync_with_stdio(false);
    solve();
    return 0;
}