#include<bits/stdc++.h>
#define int long long
using namespace std;
int exgcd(int a,int b,int &x,int &y){
	if(b==0){
		x=1;
		y=0;
		return a;
	}
	int gcd=exgcd(b,a%b,x,y);
	int t=x;
	x=y;
	y=t-a/b*y;
	return gcd;
} 
signed main(){
	int nok=0,x,y,m,n,l,X,Y,gcd;
	cin>>x>>y>>m>>n>>l;
	if((x-y)%(gcd=exgcd(n-m,l,X,Y))!=0){
		puts("Impossible");
	}
	else{
		cout<<((x-y)/gcd*X%(l/gcd)+(l/gcd))%(l/gcd)<<"\n";
	}
	return 0;
}

第一个点输出-1