#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <stack>
#include <array>
#include <fstream>


#define REP(i,n) for(int (i) = 0;(i) < (n) ; ++(i))
#define REPA(a,i,n) for(int (i) = (a) ; (i) < (n) ; ++(i))
#if defined(_MSC_VER)||__cplusplus > 199711L
#define AUTO(r,v) auto r = (v)
#else
#define AUTO(r,v) typeof(v) r = (v)
#endif
#define ALL(c) (c).begin() , (c).end()
#define EACH(it,c) for(AUTO(it,(c).begin());it != (c).end();++it)
#define LL long long
#define int LL
#define INF  999999999999
#define DEV 1000000007
#define QUICK_CIN ios::sync_with_stdio(false); cin.tie(0);
using namespace std;


int N, M;
int a[] = { 2, 3, 5, 7, 11, 13 };
int b[] = { 4, 6, 8, 9, 10, 12 };


signed main()
{
	QUICK_CIN;
	//ifstream cin("debug.txt");
	//ofstream cout("result.txt");

	cin >> N >> M;

	auto ss1 = accumulate(a, a + 6, 0);
	auto ss2 = accumulate(b, b + 6, 0);
	
	double sum = 1;

	REP(i, N){
		sum *= ss1;
	}
	REP(i, M){
		sum *= ss2;
	}

	int aa = 1;

	REP(i, N + M){
		aa *= 6;
	}

	printf("%.12lf", sum / aa);


	return 0;
}