Problem2977--Number Busters

2977: Number Busters

Time Limit: 2 Sec  Memory Limit: 256 MB
Submit: 0  Solved: 0
[Submit] [Status] [Web Board] [Creator:]

Description

time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Arthur and Alexander are number busters. Today they've got a competition.

Arthur took a group of four integers a,b,w,x (0≤b<w,0<x<w) and Alexander took integer c. Arthur and Alexander use distinct approaches to number bustings. Alexander is just a regular guy. Each second, he subtracts one from his number. In other words, he performs the assignment: c=c-1. Arthur is a sophisticated guy. Each second Arthur performs a complex operation, described as follows: if bx, perform the assignment b=b-x, if b<x, then perform two consecutive assignments a=a-1;b=w-(x-b).

You've got numbers a,b,w,x,c. Determine when Alexander gets ahead of Arthur if both guys start performing the operations at the same time. Assume that Alexander got ahead of Arthur if ca.

Input

The first line contains integers a,b,w,x,c (1≤a≤2·109,1≤w≤1000,0≤b<w,0<x<w,1≤c≤2·109).

Output

Print a single integer − the minimum time in seconds Alexander needs to get ahead of Arthur. You can prove that the described situation always occurs within the problem's limits.

Examples
Input
4 2 3 1 6
Output
2
Input
4 2 3 1 7
Output
4
Input
1 2 3 2 6
Output
13
Input
1 1 2 1 1
Output
0

Source/Category