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

signed main(){
  int N, K; cin >> N >> K;
  vector< vector< double > > dpn( N + 1, vector< double >( N * 6 + 1 ) );
  dpn[ 0 ][ 0 ] = 1.0;
  for( int i = 0; i < N; ++i )
    for( int j = 0; j < dpn[ i ].size(); ++j )
      for( int k = 1; k <= 6; ++k )
        if( j + k < dpn[ i ].size() )
          dpn[ i + 1 ][ j + k ] += dpn[ i ][ j ] / 6.0;
  vector< vector< double > > dpk( K + 1, vector< double >( K * 6 + 1 ) );
  dpk[ 0 ][ 0 ] = 1.0;
  for( int i = 0; i < K; ++i )
    for( int j = 0; j < dpk[ i ].size(); ++j )
      for( int k = 4; k <= 6; ++k )
        if( j + k < dpk[ i ].size() )
          dpk[ i + 1 ][ j + k ] += dpk[ i ][ j ] / 3.0;
  vector< double > tarou( N * 6 + 1 );
  for( int i = 0; i < dpk[ K ].size(); ++i )
    for( int j = 0; j < dpn[ N - K ].size(); ++j )
      tarou[ i + j ] += dpk[ K ][ i ] * dpn[ N - K ][ j ];
  /*for( int i = 0; i < tarou.size(); ++i )
    cout << "tarou[ " << i << " ] = " << tarou[ i ] << endl;
  for( int i = 0; i < dpn[ N ].size(); ++i )
    cout << "dpn[ " << N << " ][ " << i << " ] = " << dpn[ N ][ i ] << endl;*/
  double ans = 0.0;
  for( int i = 0; i < tarou.size(); ++i )
    for( int j = 0; j < i; ++j )
      // cout << i << " " << j << " " << tarou[ i ] * dpn[ N ][ j ] << endl,
      ans += tarou[ i ] * dpn[ N ][ j ];
  cout << fixed << setprecision( 6 ) << ans << endl;
  return 0;
}