#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>

#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;

using namespace std;


int inputValue(){
    int a;
    cin >> a;
    return a;
};

void inputArray(int * p, int a){
    rep(i, a){
        cin >> p[i];
    }
};

void inputVector(vector<int> * p, int a){
    rep(i, a){
        int input;
        cin >> input;
        p -> push_back(input);
    }
}

template <typename T>
void output(T a, int precision) {
    if(precision > 0){
        cout << setprecision(precision)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}

double power(int a, int b){
    double ret = 1;
    rep(i, b){
        ret *= a;
    }
    return ret;
}

int main(int argc, const char * argv[]) {
    
    // source code
    int P = inputValue();
    int C = inputValue();
    int sumP = 2 + 3 + 5 + 7 + 11 + 13;
    int sumC = 4 + 6 + 8 + 9 + 10 + 12;
    
    double m = power(sumP, P) * power(sumC, C);
    double n = power(6, P + C);
    
    output(m / n, 32);
    return 0;
}