//by 72
#include<bits/stdc++.h>
#define F(i, a, b) for(int i = a; i <= b; i ++)
#define Fd(i, a, b) for(int i = a; i >= b; i --)
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define int long long
using namespace std;

const int mod = 998244353;
const int N = 2e6 + 10;
const int inf = 1e18;
typedef array<int, 3> a3; 
typedef long long ll;

int n, m, v[N], qaq[N];
double f[N];

double dfs(int now) {
    if(now == ((1 << n) - 1)) return 0;
    if(v[now]) return f[now];
    double &res = f[now];
    int cnt = 0;
    double sum = 0;
    F(i, 0, n - 1) {
        int nxt = now | qaq[i];
        if(nxt == now) {
            cnt ++;
            continue;
        }
        sum += (1.0 / n) * dfs(nxt);
    }
    res = (sum + 1) * (1.0 * n / (n - cnt));
    return res;
}

void sol() {
    cin >> n >> m;
    F(i, 0, n - 1) {
        F(j, 0, m - 1) {
            int u = (i + j) % n;
            qaq[i] |= (1 << u);
        }
    }
    cout << fixed << setprecision(10);
    cout << dfs(0) << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    // cin >> t;
    F(i, 1, t) sol();
    return 0;
}
//sldl