#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T>
ostream_iterator<T> oit(const string &s = " "){ return ostream_iterator<T>(cout,s.c_str()); }
inline auto rep(int l, int r) { return views::iota(min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }
inline auto per(int l, int r) { return rep(l, r) | views::reverse; }
inline auto per(int n) { return per(0, n); }
inline auto per1(int l, int r) { return per(l, r + 1); }
inline auto per1(int n) { return per(1, n + 1); }
#define A(a) begin(a),end(a)
inline auto len = ranges::ssize;

struct chash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
template<typename T, typename U> using pb_map = gp_hash_table<T, U, chash>;
template<typename T> using pb_set = gp_hash_table<T, null_type, chash>;
#define K first
#define V second

using ll = long long;
using ld = long double;

using vi = vector<int>;
using vii = vector<vector<int>>;
typedef vector<ll> vll;
using pll = pair<ll,ll>;
using pii = pair<int,int>;

constexpr ll NN = 2e5, M = 1000000007, L = 20;

ll f1[NN], f2[NN];
ll inv(ll a, ll b=M) { return 1 < a ? b - inv(b % a, a) * b / a : 1; } // inv a mod b
ll choose(ll n, ll k) { return f1[n] * f2[k] % M * f2[n - k] % M; } // n choose k

vector<vector<int>> cache;

int dp(int n, int m) {
    if (n == 0) return 0;
    if (n == 1) return 0;
    if (m == 0) return M;
    auto& x = cache[n][m];
    if (x == -1) {
        int l = 0;
        int r = n;
        while (l < r-1) {
            int mid = (l + r) / 2;
            int x1 = dp(mid, m-1);
            int x2 = dp(n-mid, m);
            if (x1 == x2) return x = x1+1;
            else if (x1 < x2) {
                l = mid;
            } else {
                r = mid;
            }
        }
        x = min(max(dp(l, m-1), dp(n-l, m)), max(dp(r, m-1), dp(n-r, m)))+1;
    }
    return x;
}

void run()
{
    int n, m;
    cin >> n >> m;
    cache.resize(n+2, vi(m+1, -1));
    int best = dp(n+1,m);
    cout << best << " ";
    int l = 0;
    for (int k : rep(0, n+1)) {
        if (max(dp(k, m-1), dp(n-k+1, m))+1 == best) {
            l = k;
            break;
        }
    }
    int r = n;
    for (int k : per(0, n+1)) {
        if (max(dp(k, m-1), dp(n-k+1, m))+1 == best) {
            r = k;
            break;
        }
    }
    if (l == r)
        cout << l << endl;
    else
        cout << l << "-" << r << endl;
}

int main()
{
    //KING OF THE WORLD...... U.W.T.B
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    f1[0] = 1;
    f2[0] = 1;
    for (int i = 1; i < NN; i++) {
        f1[i] = f1[i - 1] * i % M;
        f2[i] = inv(f1[i], M);
    }
    int t=1; while(t--) run();
}