#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define pb push_back
#define ALL(v) v.begin(), v.end()

ll floor(ll a, ll b) {
    return a / b - (a % b && a < 0 ^ b < 0);
}

ll r, c;

ll dis(pii p1, pii p2) {
    return abs(p1.X - p2.X) + abs(p1.Y - p2.Y); 
}

vector<pll> cal(pll rng, int p) {
    pii s = {rng.X / c, rng.X % c};
    pii t = {rng.Y / c, rng.Y % c};
    vector<pii> hei;
    if (s.Y > 0)
        hei.pb({s.X + 1, t.X});
    if (t.Y < c - 1)
        hei.pb({s.X, t.X - 1});
    if (s.Y <= t.Y)
        hei.pb({s.X, t.X});
    if (s.Y > t.Y + 1)
        hei.pb({s.X + 1, t.X - 1});
    vector<pll> ret;
    for (auto [x, y] : hei) {
        if (x <= y)
            ret.pb({(p - 1) * r + x, (p - 1) * r + y}); 
    }
    return ret;
}


int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> r >> c;
    vector<pii> cent; 
    for (int i = (r + 1) / 2; i <= (r + 2) / 2; i++)
        for (int j = (c + 1) / 2; j <= (c + 2) / 2; j++)
            cent.pb({i, j});

    ll p = -1, mindis = 123456789, px = -1, py = -1;
    for (int i = 1; i <= c; i++) {
        ll s = i * r + (c - r);  
        if (s <= 0) continue;
        ll lb = floor((s - c - 1), (c - 1));
        ll rb = (s - 1) / (c - 1);
        lb = max(lb, 0LL);
        rb = min(rb, r);
        if (rb - lb != 1) continue;
        ll x = rb, y = s - (c - 1) * x;
        for (auto pt : cent)
            if (dis(pt, {x, y}) < mindis)
                mindis = dis(pt, {x, y}), p = i, px = x, py = y;
    }

    assert(p != -1);

    cout << p << " " << px << " " << py << " ";

    vector<pll> v;
    v.pb({r * (p - 1), r * p - 1});

    int tt = 1;

    while (true) {
        if (SZ(v) == 1 && v[0].X == v[0].Y) {
            ll t = v[0].X;
            ll x = t / c + 1;
            ll y = t % c + 1;
            assert(x == px && y == py);
            break;
        }
        vector<pll> res;
        for (auto rng : v) {
            auto tmp = cal(rng, p);
            for (auto nrng : tmp)
                res.pb(nrng);
        }
        sort(ALL(res));
        res.resize(unique(ALL(res)) - res.begin());
        v = res;
        tt++;
    }
    cout << tt << endl;
}