#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define N (1000000000+7) //#define N 998244353 #define INF 1e16 typedef long long ll; typedef pair P; typedef pair Q; const int inf = (int)1e9; ll gcd(ll a, ll b) { if (b > a) { ll tmp = b; b = a; a = tmp; } if (a%b == 0)return b; else return gcd(b, a%b); } ll kaijo[2000010]; void init() { kaijo[0] = 1; for (ll i = 1;i <= 2000000;i++)kaijo[i] = (kaijo[i - 1] * i) % N; } ll inv(ll x,ll power) { ll res = 1; ll k = power; ll y = x%N; while (k) { if (k & 1)res = (res*y) % N; y = (y%N*y%N) % N; k /= 2; } return res; } ll Comb(ll n, ll k) { if (n < 0 || k < 0 || (n - k) < 0)return 0; ll b = kaijo[n]; ll c = kaijo[n - k]; ll d = kaijo[k]; ll cd = (c*d) % N; return ((b%N)*(inv(cd,N-2)) % N) % N; } int main(void){ ll A,B,C,D; cin>>A>>B>>C>>D; ll ans = ((((A%D)*B)%D)*(C%D))%D; cout<