Codeforces #430(div2) A. Kirill And The Game

A. Kirill And The Game

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Kirill plays a new computer game. He came to the potion store where he can buy any potion. Each potion is characterized by two integers — amount of experience and cost. The efficiency of a potion is the ratio of the amount of experience to the cost. Efficiency may be a non-integer number.

For each two integer numbers a and b such that l ≤ a ≤ r and x ≤ b ≤ y there is a potion with experience a and cost b in the store (that is, there are (r - l + 1)·(y - x + 1) potions).

Kirill wants to buy a potion which has efficiency k. Will he be able to do this?

Input

First string contains five integer numbers l, r, x, y, k (1 ≤ l ≤ r ≤ 107, 1 ≤ x ≤ y ≤ 107, 1 ≤ k ≤ 107).

Output

Print "YES" without quotes if a potion with efficiency exactly k can be bought in the store and "NO" without quotes otherwise.

You can output each of the letters in any register.

Examples

input

1 10 1 10 1

output

YES

input

1 5 6 10 1

output

NO

乍一看这题挺水的，再一看也挺水的，但是没想可能是卡精度被hack了。。。。。

如果直接用double 存一下可以得到的最大值和最小值的话，即l/y,r/x,可能会出现精度损失

所以用乘法是最稳妥的

#include<stdio.h>
typedef long long ll;
int main()
{
    ll l,r,x,y,k;
    scanf("%lld%lld%lld%lld%lld",&l,&r,&x,&y,&k);
    for(ll i=x;i<=y;i++)
        if(i*k>=l && i*k<=r)
            return 0*printf("YES\n");
    return 0*printf("NO\n");
}