ceilDiv :: Integral a => a -> a -> a
ceilDiv t s = (t + s - 1) `div` s

solve :: Int -> Int -> Int -> Int
solve x y l = ceilDiv (abs x) l + ceilDiv (abs y) l + t
  where
    t | y < 0 = 2
      | x /= 0 = 1
      | otherwise = 0

main :: IO ()
main = do
    x <- readLn :: IO Int
    y <- readLn :: IO Int
    l <- readLn :: IO Int
    print $ solve x y l