Problem: There is a game called Sim Forest 2013. In this game, the player can become a forest god and raise forest animals.

Animals hatch from eggs and breed. When certain conditions are met, eggs are mutated with a certain probability to give birth to new races of animals.

There is an animal encyclopedia in this game, and when you get a new kind of animal, it will be recorded in the animal dictionary.

Mori is an enthusiastic player of Sim Forest 2013. His animal dictionary is complete when the remaining one race is filled.

Mori decided to obtain this remaining one race by mutation from the egg.

The game progress is as follows.

* N eggs will appear at the beginning of the stage.
* N eggs hatch s minutes after the start of the stage.
* Each egg has a 1 / p chance of targeting on a specific day of the week and within a specific time zone during the entire period * from appearance to hatching * (including the time of appearance and the moment of hatching). Mutates in animals.
* The stage ends t minutes after the start of the stage, and the same stage starts immediately after that (starts with n eggs. The elapsed time is not reset).
* The stage is repeated m times in a row.



This game meets the following specifications.

* Animals born from eggs do not lay eggs.
* Eggs hatch only once per stage, s minutes after the start of the stage.
* Mr. Sori can set the start day and start time of the first stage as desired. (The start time of the second and subsequent stages will be immediately after the end of the previous stage)
* One of {all days, Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, Saturday} is given as a mutable day.
* One of {all time zones, morning, night} is given as a mutable time zone.



Inputs are s, n, t, mutable day / time zone, p, m. Find the probability when you set the start day and start time of the first stage so that the probability of mutation occurring by the end of all stages is maximized.

Input

The input consists of multiple datasets. Each dataset is given in the following format:


s n t weekday time p m


Each dataset shows the time it takes for an egg to hatch from the start of the stage s, the number of eggs that appear at the start of the stage n, the time it takes to finish one stage t, the mutable day weekday, the mutable Time zone time, reciprocal of mutation probability p (mutation probability is 1 / p), total number of stages m.

The input satisfies the following constraints.

* 0 <s <= 500
* 0 <n <= 100
* s <t <= 1000
* weekday ∈ {All, Sun, Mon, Tue, Wed, Thu, Fri, Sat}
* All means all days of the week
* time ∈ {All, Day, Night}
* All means [0: 00 ~ 24: 00), Day means [6: 00 ~ 18: 00), and Night means [18: 00 ~ 6: 00).
* 1 <= p <= 99999
* 1 <= m <= 100



The end of the input is given on the following line.


0 0 0 None None 0 0


Output

For each dataset, output the probability when the start day and start time of the first stage is set so that the probability of mutation occurring by the end of all stages is maximized. The error in the answer must not exceed 0.00000001 (10-8). Any number of digits after the decimal point may be output as long as the precision conditions are met.

Sample Input


1 1 3 All All 1 1
2 37 5 All Night 150 1
16 2 20 All Day 5 10
1 14 15 Mon All 20000 100
0 0 0 None None 0 0


Output for Sample Input


1.0000000000
0.2192439716
0.9884707850
0.0649933899






Example

Input

1 1 3 All All 1 1
2 37 5 All Night 150 1
16 2 20 All Day 5 10
1 14 15 Mon All 20000 100
0 0 0 None None 0 0


Output

1.0000000000
0.2192439716
0.9884707850
0.0649933899

Solution (in CPP):

Solution:
#include <iostream>
#include <cstdio>
//#include <cstdlib>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
//#include <stack>
//#include <limits>
#include <sstream>
//#include <functional>
using namespace std;

#define len(array)  (sizeof (array) / sizeof *(array))
#define rep(i, s, e) for(int i = s;i < e;i++)
#define rrep(i, e, s) for(int i = e;s <= i;i--)
#define vrange(v) v.begin(), v.end()
#define vrrange(v) v.rbegin(), v.rend()
#define vsort(v) sort(vrange(v))
#define vrsort(v) sort(vrrange(v))
#define arange(a) a, a + len(a)
#define asort(a) sort(arange(a))
#define arsort(a, t) sort(arange(a), greater<t>())
#define afill(a, v) fill(arange(a), v)
#define afill2(a, v, t) fill((t *)a, (t *)(a + len(a)), v)
#define fmax(a, b) (a < b? b : a)
#define fmin(a, b) (a > b? b : a)
#define fabs(a) (a < 0? -a : a)
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-10;
//const int dx[] = {1, -1, 0, 0, 1, -1, -1, 1};
//const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};
//const int weight[] = {0,1,10,100,1000,10000,100000,1000000,10000000};
//priority_queue< int, vector<int>, greater<int> > q;

void doIt(){
  int s, n, t, p, m, npos = 0;
  string weekday, time;
  P stages[102], black[10000];
  while(true){
	npos = 0;
	cin >> s >> n >> t >> weekday >> time >> p >> m;
	if(s == 0 && n == 0) break;
	rep(i, 0, m){
	  stages[i] = P(i*t, i*t + s);
	}
	int start = 0;
	if(time == "All"){
	  //別処理
	  if(weekday == "All"){
		black[npos] = P(start, start + 110000);
		npos++;
	  }
	  else{
		while(start <= 110000){
		  black[npos] = P(start, start + 1440);
		  start += 10080;
		  npos++;
		}
	  }
	}
	else if(time == "Day"){
	  while(start <= 110000){
		black[npos++] = P(start, start + 720);
		if(weekday == "All"){
		  //start++;
		  start += 1440;
		}
		else start += 10080;
	  }
	}
	//Night
	else{
	  if(weekday == "All"){
		while(start <= 110000){
		  black[npos++] = P(start, start + 720);
		  start += 1440;
		}
	  }
	  else{
		while(start <= 110000){
		  black[npos++] = P(start,start + 360);
		  start += 360;
		  start += 720;
		  black[npos++] = P(start,start + 360);
		  start += 360;
		  start += 10080 - 1440;

		}

	  }

	}
	int aans = 0;
	rep(i, 0, t+1){
	  int spos = 0, bpos = 0, sum = 0;
	  while(spos < m && bpos < npos){
		//int tmp = min(stages[spos].second, black[bpos].second + i) - max(stages[spos].first, black[bpos].first + i);;
		if(stages[spos].first + i >= black[bpos].first && stages[spos].second + i < black[bpos].second/*tmp <= 0*/){
		  //cout << stages[spos].first << ", " << black[bpos].first + i << ", " << stages[spos].second << ", " << black[bpos].second + i << endl;
		  sum++;
		  if(spos == m-1) bpos++;
		  else spos++;
		  //sum += stages[spos].second - stages[spos].first;
		}
		else{
		  if(stages[spos].second + i < black[bpos].second){
			if(spos == m-1) bpos++;
			else spos++;
		  }
		  else{
			if(bpos == npos-1) spos++;
			else bpos++;
		  }
		}
	  }
	  //if(i == 60) cout << aans << endl;
	  //if(aans == 12) cout << "i = " << i << endl;
	  aans = max(aans, sum);
	}
	//cout << "aans = " << aans << endl;
	//aans = 13;
	double tt = ((double)p - 1.0) / p;
	double pt = 1.0 - pow(tt,aans*n);

	//printf("%.9f\n", (aans)*tt / (double)(m) );
	printf("%.11f\n", pt );
  }
}

int main() {
  doIt();
  return 0;
}