= =||| 青蛙也恋爱

                                  点击图片即可康

$设时间为time$

$由题意可列出方程:$

$(x+m\ast time)$ $\%$ $l=(y+n\ast time)$ $\%$ $l(即x+m\ast time=y+m\ast time$ $(mol$ $l))$

$⟹x-y=(n-m)\ast time(mod$ $l)$

$⟹x-y=(n-m)\ast time+num\ast l(num\in \mathbb{N})$

$很容易我们就会发现$，$这就是个$$扩欧$

$所以$，$我们就转化成求ax+by=n的所有解中x的最小解$

$如果gcd(a,b)\nmid n$，$那么无解$

$如果gcd(a,b)\mid n$，$设a=a_0\ast gcd$，$b=b_0\ast gcd$，$n=n_0\ast gcd$

$先求出a_{0}x+b_{0}y=1的一组解x^{\prime \prime }$，$y^{\prime \prime }$

$然后a_{0}x+b_{0}y=n_0的所有解可以表示为\{\begin{array}{l}{x}^{\prime }=n_0{x}^{\prime \prime }+b_{0}t\\ y^{\prime }=n_0{y}^{\prime \prime }-a_{0}t\end{array}$ $(t\in \mathbb{N})$

                                                 $(a\downarrow$ $b\uparrow )$

$该解同时也是ax+by=n的所有解$，$最后只需调到最小正整数即可$

$\mathbb{C}\mathbb{O}\mathbb{D}\mathbb{I}\mathbb{N}\mathbb{G}$

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