Problem:
Problem D: Discrete Speed

Consider car trips in a country where there is no friction.
Cars in this country do not have engines.
Once a car started to move at a speed, it keeps moving at the same speed.
There are acceleration devices on some points on the road,
where a car can increase or decrease its speed by 1.
It can also keep its speed there.
Your job in this problem is to write a program
which determines the route with the shortest time
to travel from a starting city to a goal city.

There are several cities in the country,
and a road network connecting them.
Each city has an acceleration device.
As mentioned above, if a car arrives at a city at a speed v ,
it leaves the city at one of v - 1, v , or v + 1.
The first road leaving the starting city must be run at the speed 1.
Similarly, the last road arriving at the goal city must be run at the speed 1.

The starting city and the goal city are given.
The problem is to find the best route which leads to the goal city
going through several cities on the road network.
When the car arrives at a city, it cannot immediately go back the road
it used to reach the city. No U-turns are allowed.
Except this constraint, one can choose any route on the road network.
It is allowed to visit the same city or use the same road multiple times.
The starting city and the goal city may be visited during the trip.

For each road on the network, its distance and speed limit are given.
A car must run a road at a speed less than or equal to its speed limit.
The time needed to run a road is the distance divided by the speed.
The time needed within cities including that for acceleration or deceleration should be ignored.

Input

The input consists of multiple datasets, each in the following format.

n m

s g

x 1 y 1 d 1 c 1

...

xm ym dm cm

Every input item in a dataset is a non-negative integer.
Input items in the same line are separated by a space.

The first line gives the size of the road network.
n is the number of cities in the network.
You can assume that the number of cities is between 2 and 30, inclusive.
m is the number of roads between cities, which may be zero.

The second line gives the trip.
s is the city index of the starting city.
g is the city index of the goal city.
s is not equal to g .
You can assume that all city indices in a dataset (including the above two)
are between 1 and n , inclusive.

The following m lines give the details of roads between cities.
The i -th road connects two cities with city indices
xi and yi ,
and has a distance di (1 ≤ i ≤ m ).
You can assume that the distance is between 1 and 100, inclusive.
The speed limit of the road is specified by ci .
You can assume that the speed limit is between 1 and 30, inclusive.

No two roads connect the same pair of cities.
A road never connects a city with itself.
Each road can be traveled in both directions.

The last dataset is followed by a line containing two zeros
(separated by a space).

Output

For each dataset in the input, one line should be output as specified below.
An output line should not contain extra characters such as spaces.

If one can travel from the starting city to the goal city,
the time needed for the best route (a route with the shortest time)
should be printed.
The answer should not have an error greater than 0.001.
You may output any number of digits after the decimal point,
provided that the above accuracy condition is satisfied.

If it is impossible to reach the goal city,
the string "unreachable" should be printed.
Note that all the letters of "unreachable" are in lowercase.

Sample Input

2 0
1 2
5 4
1 5
1 2 1 1
2 3 2 2
3 4 2 2
4 5 1 1
6 6
1 6
1 2 2 1
2 3 2 1
3 6 2 1
1 4 2 30
4 5 3 30
5 6 2 30
6 7
1 6
1 2 1 30
2 3 1 30
3 1 1 30
3 4 100 30
4 5 1 30
5 6 1 30
6 4 1 30
0 0

Output for the Sample Input

unreachable
4.00000
5.50000
11.25664

Solution in C++ (judge verdict: Accepted)

#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
using namespace std;

// (x,y)
typedef pair<int,int> P;
// ( テゥツ?淌・ツコツヲ , (テ・ツ可催」ツ?ョテァツ板コ,テ、ツサツ甘」ツ?ョテァツ板コ) )
typedef pair<int,P> Node;
// (cost,Node)
typedef pair<double,Node> State;

const int MAX_V = 31;
const double INF = 1e200;

struct edge{
	int to, d, c;
	edge(int to_, int d_, int c_){
		to = to_; d = d_; c = c_;
	}
};

// テ」ツつーテ」ツδゥテ」ツδ?
vector<edge> G[MAX_V];
// テ」ツつケテ」ツつソテ」ツδシテ」ツδ暗」ツ?凝」ツつ嘉」ツつエテ」ツδシテ」ツδォテ」ツ?ォティツセツソテ」ツつ甘」ツ?、テ」ツ?妥」ツつ凝」ツ?凝」ツ?ゥテ」ツ??」ツ??
bool memo[MAX_V];
bool is_connect;

// テ・ツ?・テ・ツ環?
int n, m;

// テ・ツ按敕ヲツ慊淌・ツ個?
void init(){
	is_connect = false;
	for(int i=0 ; i < MAX_V ; i++ ){
		G[i].clear();
	}
}

// ティツセツコテ」ツ?ョティツソツステ・ツ環?
void add_edge(int x, int y, int d, int c){
	edge e( y , d , c );
	G[x].push_back( e );
	e.to = x;
	G[y].push_back( e );
}

// テ」ツつケテ」ツつソテ」ツδシテ」ツδ暗」ツ?凝」ツつ嘉」ツつエテ」ツδシテ」ツδォテ」ツ?ォティツセツソテ」ツつ甘」ツ?、テ」ツ?妥」ツつ凝」ツ?凝」ツ?ゥテ」ツ??」ツ?凝」ツδ?」ツつァテ」ツδε」ツつッ
void check(int v, int g){
	if( v == g ){
		is_connect = true;
	}
	if( memo[v] ) return;
	memo[v] = true;
	
	for(int i=0 ; i < G[v].size() ; i++ ){
		int to = G[v][i].to;
		if( memo[to] ) continue;
		check( to , g );
	}
}

// テ」ツδ?」ツつ、テ」ツつッテ」ツつケテ」ツδ暗」ツδゥテヲツウツ?
double solve(int s, int g){
	// d[v][x][y] := テゥツ?淌・ツコツヲv, テ・ツ可催」ツ?ョテァツ板コx, テ、ツサツ甘」ツ?ョテァツ板コyテ」ツ?セテ」ツ?ァテ」ツ?ョテヲツ慊?・ツーツ湘」ツつウテ」ツつケテ」ツδ?
	double d[31][31][31];
	// ティツィツェテ」ツつ古」ツ?淌」ツ?凝」ツ?ゥテ」ツ??」ツ??
	bool visited[31][31][31];
	// テ・ツ按敕ヲツ慊淌・ツ個?
	for(int y=0 ; y < MAX_V ; y++ ){
		for(int x=0 ; x < MAX_V ; x++ ){
			for(int v=0 ; v < 31 ; v++ ){
				d[v][y][x] = INF;
				visited[v][y][x] = false;
			}
		}
	}
	
	// State := (cost,Node), Node := ( テゥツ?淌・ツコツヲ , (テ・ツ可催」ツ?ョテァツ板コ,テ、ツサツ甘」ツ?ョテァツ板コ) )
	priority_queue< State, vector<State> , greater<State> > q;
	for(int i = 0 ; i < G[s].size() ; i++ ){
		int to = G[s][i].to;
		double dis = G[s][i].d;
		
		Node start( 1 , P(s,to) );
		q.push( State(dis,start) );
		d[1][s][to] = dis;
	}
	
	double ans = INF;
	int cnt=0;
	while( !q.empty() ){
		//cnt++;
		//if( cnt >= 2000000 ) break;
		
		// テ・ツ?、テ」ツつ津・ツ渉姪」ツつ甘・ツ?コテ」ツ??
		double now_cost = q.top().first;
		int v = q.top().second.first;
		int x = q.top().second.second.first;
		int y = q.top().second.second.second;
		q.pop();
		
		if( now_cost >= ans || visited[v][x][y] ) continue;
		visited[v][x][y] = true;
		
		// テァツ崢ョテァツ堋?・ツ慊ーテ」ツ?ョテ」ツ?ィテ」ツ??
		if( y == g && v == 1 ){
			ans = min( ans , now_cost );
			break;
		}
		
		for(int i=0 ; i < G[y].size() ; i++ ){
			int to = G[y][i].to;
			int dis = G[y][i].d;
			int c = G[y][i].c;
			if( to == x ) continue;
			
			for(int dv = -1 ; dv <= 1 ; dv++ ){
				int next_v = v + dv;
				if( next_v > c || next_v <= 0 ) continue;
				
				double cost = (double)dis / next_v;
				if( now_cost + cost < d[next_v][y][to] ){
					d[next_v][y][to] = now_cost + cost;
					
					Node next( next_v , P(y,to) );
					State p( now_cost + cost , next );
					q.push( p );
				}
			}
		}
	}
	return ans;
}

int main(){
	while( scanf("%d %d", &n, &m) , n || m ){
		// テ・ツ按敕ヲツ慊淌・ツ個?
		init();
		
		int s, g;
		cin >> s >> g;
		
		for(int i=0 ; i < m ; i++ ){
			int x, y, d, c;
			scanf("%d %d %d %d", &x, &y, &d, &c );
			add_edge( x , y , d , c );
		}
		
		{
			// テ」ツつケテ」ツつソテ」ツδシテ」ツδ暗」ツ?凝」ツつ嘉」ツつエテ」ツδシテ」ツδォテ」ツ?ォティツセツソテ」ツつ甘」ツ?、テ」ツ?妥」ツつ凝」ツ?凝」ツ?ゥテ」ツ??」ツ??
			for(int i=0 ; i < MAX_V ; i++ ){
				memo[i] = false;
			}
			check( s , g );
		}
		
		// テ」ツつエテ」ツδシテ」ツδォテ」ツ?ォティツセツソテ」ツつ甘」ツ?、テ」ツ?妥」ツ?ェテ」ツ??」ツ?ィテ」ツ??
		if( is_connect == false ){
			puts("unreachable");
		}else{
			double ans = solve( s , g );
			printf("%.4f\n", ans );
		}
	}
}