#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

int main()
{
	int P, C;
	cin >> P >> C;
	
	double prime = (2 + 3 + 5 + 7 + 11 + 13) / 6.0;
	double synthesis = (4 + 6 + 8 + 9 + 10 + 12) / 6.0;

	double ans = 1;
	for (int i = 0; i < P; i++) {
		ans *= prime;
	}

	for (int i = 0; i < C; i++) {
		ans *= synthesis;
	}

	printf("%.10f\n",ans);
	return 0;
}