#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <cstdio>
#include <cstring>
#include <climits>
#include <cmath>
using namespace std;

#define rep(i,n) for(ll i=0;i<n;i++)
#define REP(i,x,n) for(ll i=x;i<n;i++)
#define ALL(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<":"<<x<<endl
#define debug2(x,y) cout<<#x<<":"<<#y<<"=="<<x<<":"<<y<<endl
const int INF = INT_MAX / 3;
const int dx[] = { 1, 0, -1, 0 }, dy[] = { 0, 1, 0, -1 };
#define MOD 1000000007
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;



int main(){
	int P, C;
	cin >> P >> C;
	vector<int> sosu{ 2, 3, 5, 7, 11, 13 };
	vector<int> gousei{ 4, 6, 8, 9, 10, 12 };

	double ans = 1;
	double s = 0;
	rep(i, 6) s += sosu[i];
	s /= 6;
	double g = 0;
	rep(i, 6) g += gousei[i];
	g /= 6;
	rep(i, P) ans *= s;
	rep(i, C) ans *= g;
	printf("%.20f\n", ans);
	return 0;
}