#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#define N 1000
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
int main(void){
	ll a,b,c;
	ll s,t;
	cin>>t>>s>>c;
	ll k=0;
	a=(s<0)?-s:s;
	b=(t<0)?-t:t;
	k+=a/c + !!(a%c); // tate
	if(s<0&&b==0)k+=2;
	if(s<0&&b!=0)k++;
	if(b!=0){
		k++;
		k+=b/c + !!(b%c);
	}
	cout<<k<<endl;

	return 0;
}