#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);

using namespace std;

namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const double EPS = 1e-8, INF = 1e12, PI = acos(-1.0);
typedef complex<double> P;
namespace std{
	bool operator<(const P& a, const P& b){
		return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);
	}
}
inline double cross(const P& a, const P& b){ return imag(conj(a)*b); }
inline double dot(const P& a, const P& b){ return real(conj(a)*b); }
struct L : public vector<P>{
	L(const P &a, const P &b) {
		push_back(a); push_back(b);
	}
};
typedef vector<P> G;
inline int ccw(P a, P b, P c) {
	b -= a; c -= a;
	if(cross(b, c) >  EPS)   return +1;      // counter clockwise
	if(cross(b, c) < -EPS)   return -1;      // clockwise
	if(dot(b, c)   < -EPS)   return +2;      // c--a--b on line
	if(norm(b)+EPS <norm(c)) return -2;      // a--b--c on line
	return 0;                                   // c is between a and b (inclusive)
}
G intersect(P c, double r, P p1, P p2) {
  P u = p2 - p1, v = p1 - c;
  auto a = dot(u,u), b = dot(u,v)/a, t = (dot(v,v) - r*r)/a;
  auto det = b*b - t;
  if (det <  -EPS) return {};          // no solution

  auto t1 = -b - sqrt(det), t2 = -b + sqrt(det);
  G ps;
  auto insert_if_possible = [&](P p) {
    for (auto q: ps) if (abs(dot(p-q, p-q)) < EPS) return;
    ps.push_back(p);
  };
  if (r - norm(p1-c) > - EPS) insert_if_possible(p1);
  if (t1 > -EPS && 1-t1 > -EPS) insert_if_possible(p1+t1*u);
  if (t2 > -EPS && 1-t2 > -EPS) insert_if_possible(p1+t2*u);
  if (r - norm(p2-c) > -EPS) insert_if_possible(p2);
  return ps;
}

const double rm = 1800;
const double om = 380000;
const double pm = 2500000;

const double ok = rm + 100;
const double pk = 2 * 3600;

int main(){
	cin.tie(0); cin.sync_with_stdio(0);
	int m, t; cin >> m >> t; t *= 60;
	double ans = 0;
	const int ITER = t * 10;
	
	rep(it, ITER){
		double T = t * (it + 0.5) / ITER;
		double tm = m / 180.0 * PI + T * 2 * PI / pm;
		double tk = PI / 2 + T * 2 * PI / pk;
		
		double mx = om * cos(tm), my = om * sin(tm);
		double kx = ok * cos(tk), kz = ok * sin(tk), ky = 0;
		kx += mx; ky += my;
		
		P K(kx, ky);
		P M0 (mx, my);
		P M = K * dot(M0, K) / norm(K);
		double d = abs(M - M0);
		double mr;
		if(d > rm - EPS) mr = 0;
		else mr = sqrt(rm * rm - d * d);
		
		bool hide = !intersect(P(abs(M), 0), mr, P(0, 0), P(abs(K), kz)).empty();
		if(hide) ans += 1.0 * t / ITER;
	}
	printf("%.20f\n", ans / 60);
	return 0;
}


Measured memory_bytes: 3604