[2018-4-27]BNUZ套题比赛div2 CodeForces - 842A

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

这题不能用( l / y <= k && k >= r / x)因为之间会有一些值无法取到因为要求是整数，所以只能反过来看，给一组数据4 4 1 2 3

#include<bits/stdc++.h>

using namespace std;

int main()
{
	long long l,r,x,y,k;
	while(cin>>l>>r>>x>>y>>k)
	{
		int judge = 0;
		for(int i = x ; i <= y ; i++)
		{
			if(l <= k * i && k * i <= r)
			{
				judge = 1;
				break;
			}
		}
		if(judge)
		{
			cout<<"YES"<<endl;
		}
		else
		{
			cout<<"NO"<<endl; 
		}
	}
}