import sys
import math
import bisect
from heapq import heapify, heappop, heappush
from collections import deque, defaultdict, Counter
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product

sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD99 = 998244353

input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
SMI = lambda: input().split()
SLI = lambda: list(SMI())
EI = lambda m: [NLI() for _ in range(m)]


def main():
    X = NI()
    Y = NI()
    L = NI()
    ans = 0
    if Y < 0:
        ans += 2
    elif Y == 0:
        if X == 0:
            print(0)
            return
        else:
            ans += 1
    else:
        if X == 0:
            ans += 0
        else:
            ans += 1

    X = abs(X)
    Y = abs(Y)
    ans += (X+L-1)//L
    ans += (Y+L-1)//L
    print(ans)


if __name__ == "__main__":
    main()