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

Copy

1 10 1 10 1

Output

Copy

YES

Input

Copy

1 5 6 10 1

Output

Copy

NO

-----------------------------------------------------------------

判断能不能找到a/b=k；

-----------------------------------------------------------------

暴力跑一遍找；不用找到那个数，只要判断能不能找到

--------------------------------------------------------------------

#include<deque>
#include<queue>  
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<stack>
const int inf = 0x3f3f3f3f;
using namespace std;
long long int a, b, c, d, e;
int main()
{
   
    cin >> a >> b >> c >> d >> e;
    for (int i = c; i <= d; i++) 
    {
       long long int num = i*e;
        if (num >= a&&num <= b) 
        {
            cout << "YES" << endl;
            return 0;
        }
        else if (num > b) 
        {
            break;
        }
    }
    cout << "NO" << endl;
    return 0;

}