#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int p[] = { 2, 3, 5, 7, 11, 13 };
const int c[] = { 4, 6, 8, 9, 10, 12 };

int main()
{
	ios_base::sync_with_stdio(0);
	int P, C; cin >> P >> C;

	int sump = accumulate (p, p+6, 0 );	
	int sumc = accumulate (c, c+6, 0 );
//	cerr << sump << ' ' << sumc << endl;

	double sum = 1.;
	sum *= (double)pow(sump, P );
	sum *= (double)pow(sumc, C );

	int PC = P + C;
	while (PC-- ) sum /= 6.;
	printf ("%.9lf\n", sum );
		
	return 0;
}