#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll,ll> P;
typedef string str;
typedef vector<P> vp;
typedef vector<string> vs;
typedef vector<bool> vb;

const ll mod=1e9;
const ll inf=1e16;

#define rep(i,m,n) for(ll i=m;i<n;i++)
#define repr(i,m,n) for(ll i=m-1;i>=n;i--)
#define fi first
#define se second
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#define eb(x) emplace_back(x)
#define pb(x) pop_back(x)
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define sum(x) accumulate(all(x),0)
#define pc(x) __builtin_popcount(x)
#define gll greater<ll>()

void solve(){
 ll p,c;
  cin >> p >> c;
 long double prime,com;
 prime=(2+3+5+7+11+13)/6.0;
 com=4+6+8+9+10+12;
 com/=6.0;
  
 long double ans=1;
  rep(i,0,p) ans*=prime;
  rep(i,0,c) ans*=com;
  
  cout << fixed << setprecision(12) << ans << endl;
}  
int main(){
   cin.tie(nullptr);
  ios::sync_with_stdio(false);
  solve();
}