a = int(input())
b = int(input())
n = int(input())
m = int(input())
if n + (n-1)*a == m + (m-1)*b:
  print(n + (n-1)*a, min(n + (n+1)*a, m + (m+1)*b))
else:
  print(-1)
# -----------------------------------------------------
def f(x):
  return 2*a*x + 2*b*x - 4*x*x

def binSearch(k):
  l = 1
  r = 0
  while f(r+1) > f(r):
    r += 1
    if r > 10**4:
      r = 10**8
      break
  while l<r:
    m = (l+r)//2
    if 2*a*m + 2*b*m - 4*m*m >= k:
      r = m
    else:
      l = m+1
  return r

def main():
  global a
  global b
  a, b, k = int(input()), int(input()), int(input())
  res = binSearch(k)
  print(res if f(res) <= k else res-1)

if __name__ == "__main__":
  main()