#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long int ll;
using namespace std;
const int inf=1e9+7;

int P, C;
int main(){
    cin>>P>>C;
    ll a=(2+3+5+7+11+13);
    ll b=(4+6+8+9+10+12);
    printf("%.10lf", 1.0*pow(a,P)*pow(b,C)/pow(6,P+C));
    return 0;
}