The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

brute force

probabilities

*1900

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Lucky Probability

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPetya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.

Petya and his friend Vasya play an interesting game. Petya randomly chooses an integer *p* from the interval [*p*_{l}, *p*_{r}] and Vasya chooses an integer *v* from the interval [*v*_{l}, *v*_{r}] (also randomly). Both players choose their integers equiprobably. Find the probability that the interval [*min*(*v*, *p*), *max*(*v*, *p*)] contains exactly *k* lucky numbers.

Input

The single line contains five integers *p*_{l}, *p*_{r}, *v*_{l}, *v*_{r} and *k* (1 ≤ *p*_{l} ≤ *p*_{r} ≤ 10^{9}, 1 ≤ *v*_{l} ≤ *v*_{r} ≤ 10^{9}, 1 ≤ *k* ≤ 1000).

Output

On the single line print the result with an absolute error of no more than 10^{ - 9}.

Examples

Input

1 10 1 10 2

Output

0.320000000000

Input

5 6 8 10 1

Output

1.000000000000

Note

Consider that [*a*, *b*] denotes an interval of integers; this interval includes the boundaries. That is,

In first case there are 32 suitable pairs: (1, 7), (1, 8), (1, 9), (1, 10), (2, 7), (2, 8), (2, 9), (2, 10), (3, 7), (3, 8), (3, 9), (3, 10), (4, 7), (4, 8), (4, 9), (4, 10), (7, 1), (7, 2), (7, 3), (7, 4), (8, 1), (8, 2), (8, 3), (8, 4), (9, 1), (9, 2), (9, 3), (9, 4), (10, 1), (10, 2), (10, 3), (10, 4). Total number of possible pairs is 10·10 = 100, so answer is 32 / 100.

In second case Petya always get number less than Vasya and the only lucky 7 is between this numbers, so there will be always 1 lucky number.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/21/2024 01:18:37 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|