722 B | 722 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
# sys.setrecursionlimit(10**7)
BLANK = " "
# inp = input
inp = lambda : sys.stdin.readline().rstrip()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
p = print
def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)
def solve():
x1, v1 = mii()
x2, v2 = mii()
T = ii()
A = x1 + v1 * T
B = x2 + v2 * T
if (A < B) != (x1 < x2):
p(B, v2)
p(A, v1)
else:
p(A, v1)
p(B, v2)
if __name__ == "__main__":
tc = 1
for t in range(1, tc+1):
ret = solve()