#include<iostream>
#include<math.h>
#include<vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

#define MAX 100

signed main()
{
    int N, K;
    cin >> N >> K;
    
    double dp1[100] = {0};
    double dp2[100] = {0};
    
    dp1[0] = dp2[0] = 1;
    REP(i,N) {
        RREP(j,MAX-10) {
            FOR(k,1,7) {
                dp1[j+k] += dp1[j] / 6;
            }
            dp1[j] = 0;
        }
    }
    
    REP(i,N-K) {
        RREP(j,MAX-10) {
            FOR(k,1,7) {
                dp2[j+k] += dp2[j] / 6;
            }
            dp2[j] = 0;
        }
    }
    
    REP(i,K) {
        RREP(j,MAX-10) {
            FOR(k,4,7) {
                dp2[j+k] += dp2[j] / 3;
            }
            dp2[j] = 0;
        }
    }
    
    double ret = 0;
    REP(i,MAX) {
        FOR(j,i+1,MAX) {
            ret += dp1[i] * dp2[j];
        }
    }
    
    printf("%.14f\n", ret);
    
    return 0;
}