Vanya loves playing. He even has a special set of cards to play with. Each card has a single integer. The number on the card can be positive, negative and can even be equal to zero. The only limit is, the number on each card doesn't exceed x in the absolute value.

Natasha doesn't like when Vanya spends a long time playing, so she hid all of his cards. Vanya became sad and started looking for the cards but he only found n of them. Vanya loves the balance, so he wants the sum of all numbers on found cards equal to zero. On the other hand, he got very tired of looking for cards. Help the boy and say what is the minimum number of cards does he need to find to make the sum equal to zero?

You can assume that initially Vanya had infinitely many cards with each integer number from  - x to x.

 


-----Input-----

The first line contains two integers: n (1 ≤ n ≤ 1000) — the number of found cards and x (1 ≤ x ≤ 1000) — the maximum absolute value of the number on a card. The second line contains n space-separated integers — the numbers on found cards. It is guaranteed that the numbers do not exceed x in their absolute value.


-----Output-----

Print a single number — the answer to the problem.


-----Examples-----
Input
3 2
-1 1 2

Output
1

Input
2 3
-2 -2

Output
2



-----Note-----

In the first sample, Vanya needs to find a single card with number -2.

In the second sample, Vanya needs to find two cards with number 2. He can't find a single card with the required number as the numbers on the lost cards do not exceed 3 in their absolute value.

Source: codeforces | Difficulty: EASY
Tags: Mathematics

Implementation


Solutions:
(n, m) = map(int, input().split())
l = list(map(int, input().split()))
plus = 0
for i in range(n):
	plus += l[i]
z = plus / m
if plus % m == 0:
	z = int(z)
	x = abs(z)
	print(x)
else:
	z = int(z)
	x = abs(z)
	print(x + 1)


(n, a) = map(int, input().split())
num = list(map(int, input().split()))[:n]
s = 0
s = sum(num)
if s <= a and s > 0:
	print(1)
elif s == 0:
	print(0)
else:
	s = abs(s)
	if s % a == 0:
		print(s // a)
	else:
		print(s // a + 1)


import math
(n, m) = map(int, input().split())
l = list(map(int, input().split()))
a = abs(sum(l))
print(math.ceil(a / m))


(n, x) = map(int, input().split())
l = list(map(int, input().split()))
s = 0
l1 = []
for i in l:
	s = s + i
	if s == 0:
		l1 = []
	else:
		l1.append(i)
s1 = 0
c = 0
for i in l1:
	s1 = s1 + i
if s1 == 0:
	print(0)
elif abs(s1) <= x:
	print(1)
else:
	s1 = abs(s1)
	z = int(s1 // x)
	c = c + z
	y = s1 % x
	if y > 0:
		c = c + 1
	print(c)


nx = list(map(int, input().split()))
cards = list(map(int, input().split()))
summa = 0
for i in range(nx[0]):
	summa += cards[i]
if abs(summa) % nx[1] == 0:
	print(abs(summa) // nx[1])
else:
	print(abs(summa) // nx[1] + 1)


(n, x) = input().split()
a = input()
a = [int(g) for g in a.split()]
dif = abs(sum(a))
cards = 0
if dif % int(x) == 0:
	cards += dif // int(x)
else:
	cards += dif // int(x)
	cards += 1
print(cards)


(n, x) = [int(string) for string in input().split()]
s_cards = sum([int(string) for string in input().split()])
delta = abs(s_cards)
if delta == 0:
	print(0)
elif delta <= x:
	print(1)
else:
	print(delta // x + (1 if delta % x > 0 else 0))


import math
(n, m) = map(int, input().split())
numbers = [int(l) for l in input().split()]
s = abs(sum(numbers))
print(math.ceil(s / m))


from math import ceil
(n, x) = list(map(int, input().split()))
t = abs(sum(list(map(int, input().split()))))
print(ceil(t / x))


import re
import sys
import math
import itertools
import collections

def inputArray(TYPE=int):
	return [TYPE(x) for x in input().split()]

def solve():
	(n, x) = inputArray()
	a = inputArray()
	total = sum(a)
	if total < 0:
		total = -total
	cc = math.ceil(total / x)
	print(cc)
solve()


import math
(n, m) = list(map(int, input().split()))
l = list(map(int, input().split()))
s = sum(l)
if s == 0:
	print('0')
else:
	print(math.ceil(abs(s) / m))


I = lambda : map(int, input().split())
(n, x) = I()
s = abs(sum(I()))
print(s // x + (s % x > 0))


(n, x) = list(map(int, input().split()))
d = list(map(int, input().split()))
ss = sum(d)
result = abs(ss) // x
if ss % x != 0:
	result += 1
print(result)


(n, x) = list(map(int, input().split()))
found = list(map(int, input().split()))
tot = abs(sum(found))
if tot == 0:
	print(0)
elif tot <= x:
	print(1)
else:
	print(tot // x if tot % x == 0 else tot // x + 1)


(n, x) = input().split()
n = int(n)
x = int(x)
tsum = 0
count = 0
sign = 1
odd = 0
cards = [int(y) for y in input().split()]
for i in cards:
	tsum = i + tsum
if tsum < 0:
	tsum *= -1
tsum = int(tsum)
if tsum % x == 0:
	print(int(tsum / x))
else:
	print(int(tsum / x) + 1)


[n, x] = map(int, input().split())
nn = map(int, input().split())
nn_sum = int(abs(sum(nn)))
res = 0
while nn_sum > 0:
	res += 1
	nn_sum -= x
print(res)


def gadr(m):
	if m >= 0:
		return m
	elif m < 0:
		return -m
(n, x) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
m = 0
for i in range(n):
	m = m + a[i]
m = gadr(m)
a = m // x
b = m % x
if b == 0:
	print(a)
else:
	print(a + 1)


from math import sqrt

def main():
	(n, m) = [int(v) for v in input().split()]
	vals = [int(v) for v in input().split()]
	d = sum(vals)
	diff = abs(d)
	print(diff // m + (1 if diff % m != 0 else 0))
main()


import math
(n, x) = map(int, input().split())
sum_found = sum([int(i) for i in input().split()])
sum_need = abs(sum_found)
print(math.ceil(sum_need / x))


(n, a) = map(int, input().split())
print(str((abs(sum(map(int, input().split()))) + a - 1) // a))


r = lambda : list(map(int, input().split()))
x = r()[1]
s = abs(sum(r()))
print(0 if s == 0 else s // x + 1 if s != x and s % x != 0 else s // x)


(n, x) = map(int, input().split())
l1 = list(map(int, input().split()))
s = sum(l1)
if abs(s) % x != 0:
	print(abs(s) // x + 1)
else:
	print(abs(s) // x)


s = [int(i) for i in input().split()]
d = [int(i) for i in input().split()]
a = abs(sum(d))
answer = int(a / s[1])
if a % s[1] > 0:
	answer += 1
print(answer)


import math
(x, y) = map(int, input().split())
print(math.ceil(abs(sum(map(int, input().split()))) / y))


(n, x) = map(int, input().split())
z = abs(sum(list(map(int, input().split()))))
if z % x == 0:
	print(z // x)
else:
	print(z // x + 1)


(n, x) = map(int, input().split())
a = [int(a) for a in input().split()]
s = sum(a)
if s == 0:
	print(0)
elif abs(s - 0) <= x:
	print(1)
else:
	rem = abs(s) / x
	if abs(s) % x != 0:
		rem += 1
	print(int(rem))


import math, fractions, collections
(n, x) = [int(x) for x in input().split()]
q = [int(x) for x in input().split()]
print(math.ceil(abs(sum(q) / x)))


def do(a, x):
	if a == 0:
		return 0
	a = abs(a)
	if a % x == 0:
		return a // x
	else:
		return a // x + 1
(n, x) = list(map(int, input().split()))
a = sum(map(int, input().split()))
print(do(a, x))


c = input()
c = c.split()
c1 = int(c[0])
c2 = int(c[1])
a = input()
a = a.split()
con = 0
for k in range(len(a)):
	a[k] = int(a[k])
b = sum(a)
if b == 0:
	print(0)
else:
	if b < 0:
		n = b * -1
	else:
		n = b
	if n <= c2:
		suma = 1
	else:
		suma = n // c2
		if n % c2 != 0:
			suma = suma + 1
	print(suma)


(n, m) = map(int, input().split())
a = list(map(int, input().split()))
o = abs(sum(a))
ot = 0
if o % m:
	ot += 1
print(ot + o // m)


from math import ceil
(n, x) = map(int, input().split())
c = list(map(int, input().split()))
s = sum(c)
print(ceil(abs(s) / x))


(n, x) = map(int, input().split())
arr = [int(x) for x in input().split()]
sum = abs(sum(arr))
sum = sum + x - 1
print(sum // x)


(n, x) = map(int, input().split())
l = list(map(int, input().split()))
a = abs(sum(l))
if a == 0:
	print(0)
elif a % x == 0:
	print(a // x)
else:
	print(a // x + 1)


z = input
(n, x) = map(int, z().split())
l = sum(list(map(int, z().split())))
from math import *
print(ceil(abs(l) / x))


import math
(n, x) = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a)
print(math.ceil(abs(s) / x))


(n, x) = input().split(' ')
sum = 0
x = abs(int(x))
k = input().split(' ')
for i in k:
	sum += int(i)
if sum < 0:
	sum = -sum
if sum % x == 0:
	num = int(sum / x)
else:
	num = int(sum / x) + 1
print(num)


i = lambda : map(int, input().split())
(n, x) = i()
l = abs(sum(i()))
print(0 - -l // x)


import math

def ost(a, b):
	if a % b != 0:
		return 1
	return 0
(n, x) = map(int, input().split())
a = list(map(int, input().split()))
s = 0
for i in range(n):
	s += a[i]
print(abs(s) // x + ost(s, x))


def abs(n):
	if n < 0:
		temp = n * -1
	else:
		temp = n
	return temp

def findMax(req, limit):
	req = abs(req)
	if req == 0:
		return 0
	if req <= limit:
		return 1
	elif req % limit == 0:
		return req / limit
	else:
		return 1 + req // limit
det = input()
lim = int(det.split(' ')[-1])
dat = input()
dat = dat.split(' ')
dat = [int(each) for each in dat]
temp = 0
for each in dat:
	temp += each
out = int(findMax(temp, lim))
print(out)


from math import ceil as c
(n, x) = map(int, input().split())
a = list(map(int, input().split()))[:n]
k = abs(sum(a))
if sum(a) == 0:
	print(0)
else:
	print(c(k / x))


(n, x) = [int(x) for x in input().split(' ')]
l = [int(x) for x in input().split(' ')]
sm = abs(sum(l))
if sm % x != 0:
	print(sm // x + 1)
else:
	print(sm // x)


(nn, xx) = input().split(' ')
n = int(nn)
x = int(xx)
a = input().split(' ')
s = 0
for i in range(n):
	s += int(a[i])
s = abs(s)
print((s + x - 1) // x)


(n, x) = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a)
ans = 0
diff = abs(s)
while x <= diff:
	ans += 1
	diff -= x
if diff != 0:
	ans += 1
print(ans)


(n, x) = map(int, input().split())
a = list(map(int, input().split()))
value = abs(sum(a))
if value % x == 0:
	if value == 0:
		print(0)
	else:
		print(value // x)
else:
	print(value // x + 1)


(n, m) = map(int, input().split())
l = sum(list(map(int, input().split())))
if l % m == 0:
	print(abs(l) // m)
else:
	print(abs(l) // m + 1)


import sys
input = sys.stdin.readline
ins = lambda : input().rstrip()
ini = lambda : int(input().rstrip())
inm = lambda : map(int, input().rstrip().split())
inl = lambda : list(map(int, input().split()))
out = lambda x, s='\n': print(s.join(map(str, x)))
(n, x) = inm()
a = inl()
total = sum(a)
if total == 0:
	print(0)
elif abs(total) < x:
	print(1)
else:
	print((abs(total) + x - 1) // x)


import math
(n, m) = map(int, input().split())
a = list(map(int, input().split()))
sum_ = sum(a)
s = 0
if sum_ == 0:
	print('0')
else:
	if abs(sum_) > m:
		sum_ = abs(sum_)
		while sum_ != 0:
			g = math.floor(sum_ / m)
			sum_ = sum_ - g * m
			s = s + g
			m = m - 1
	else:
		sum_ = 0
		s = 1
	print(s)


(n, x) = (int(x) for x in input().split())
res = abs(sum([int(x) for x in input().split()]))
if res % x == 0:
	print(int(res / x))
else:
	print(int(res / x + 1))


(n, x) = [int(x) for x in input().split(' ')]
s = sum([int(x) for x in input().split(' ')])
if s == 0:
	print(0)
else:
	z = abs(s)
	ans = z // x
	if z % x != 0:
		ans += 1
	print(ans)


(n, x) = map(int, input().split())
num = list(map(int, input().split()))
if sum(num) == 0:
	need = 0
elif abs(sum(num)) % x == 0:
	need = abs(sum(num)) // x
else:
	need = abs(sum(num)) // x + 1
print(need)


(N, X) = map(int, input().split())
S = abs(sum(list(map(int, input().split()))))
print(S // X + min(S % X, 1))


import math
a = input('').split(' ')
maxval = int(a[1])
b = input('').split(' ')
sumof = 0
for value in b:
	sumof = sumof + int(value)
sumof = abs(sumof)
print(math.ceil(sumof / maxval))


from functools import reduce
(n, x) = map(int, input().split())
s = list(map(int, input().split()))
s = sum(s)
s = abs(s)
ans = s // x
if s % x == 0:
	print(ans)
else:
	print(ans + 1)


import math
import os
import random
import re
from sys import stdin, stdout
from collections import Counter

def si():
	return str(input())

def ii():
	return int(input())

def mi():
	return map(int, input().split())

def li():
	return list(mi())
(n, x) = mi()
arr = li()
k = abs(sum(arr))
ans = k // x
if k % x != 0:
	ans += 1
print(ans)


bot = True
(n, k) = map(int, input().split())
print((abs(sum(map(int, input().split()))) + k - 1) // k)


from math import ceil as c
(n, x) = map(int, input().split())
a = list(map(int, input().split()))
print(c(abs(sum(a)) / x))


import sys
from math import sqrt, floor, factorial, gcd
from collections import deque, Counter
inp = sys.stdin.readline
read = lambda : list(map(int, inp().strip().split()))

def solve():
	(n, x) = read()
	s = abs(sum(read()))
	print([0, s // x][s >= x] + [0, 1][s % x != 0] if s != 0 else 0)
solve()


from operator import itemgetter
(n, x) = map(int, input().split())
ai = list(map(int, input().split()))
num = abs(sum(ai))
print(num // x + (num % x != 0))


def answer():
	a = [int(x) for x in input().split()]
	n = a[1]
	b = [int(x) for x in input().split()]
	c = sum(b)
	if sum(b) == 0:
		print(0)
	else:
		k = abs(sum(b))
		if k <= n:
			print(1)
		else:
			print(int(k / n) + 1 * (k % n != 0))
answer()


(amount, x) = map(int, input().split())
data = [int(i) for i in input().split()]
_sum = 0
ans = 0
for i in data:
	_sum += i
_sum = abs(_sum)
while _sum > 0:
	_sum -= x
	ans += 1
print(ans)


(n, x) = input().split()
n = int(n)
x = int(x)
l = input().split()
s = 0
for i in range(n):
	l[i] = int(l[i])
	s += l[i]

def mod(x):
	if x >= 0:
		return x
	else:
		return -x
if mod(s) <= mod(x):
	if s == 0:
		print(0)
	else:
		print(1)
else:
	s = mod(s)
	k = 0
	while s != 0:
		k += s // x
		s -= s // x * x
		x -= 1
	print(k)


(no_of_cards, max_value) = map(int, input().split())
card_value = list(map(int, input().split()))
total_value = abs(sum(card_value))
add_value = total_value // max_value
if total_value % max_value != 0:
	add_value += 1
print(add_value)


import sys
(n, x) = map(int, sys.stdin.readline().split())
a = abs(sum(list(map(int, sys.stdin.readline().split()))))
print((a + x - 1) // x)


(n, x) = map(int, input().split())
l = list(map(int, input().split()))
sum = 0
for i in range(n):
	sum += l[i]
if sum == 0:
	print(0)
elif abs(sum) <= x:
	print(1)
elif abs(sum) > x:
	if abs(sum) % x == 0:
		print(abs(sum) // x)
	else:
		print(abs(sum) // x + 1)


(n, x) = map(int, input().split())
arr = abs(sum([int(i) for i in input().split()]))
ans = arr // x
if arr % x:
	ans += 1
print(ans)


import math
(n, m) = map(int, input().split())
l = list(map(int, input().split()))
s = abs(sum(l))
d = math.ceil(s / m)
print(d)


(n, x) = map(int, input().split())
a = list(map(int, input().split()))
total = 0
for i in range(len(a)):
	total += a[i]
if total < 0:
	result = 0 - total
else:
	result = abs(0 - total)
if result == 0:
	print(0)
elif x >= result:
	print(1)
else:
	answer = result / x
	stro = str(answer)
	if stro[-2:] == '.0':
		print(stro[:-2])
	elif type(answer) is int:
		print(answer)
	else:
		print(result // x + 1)


import sys
import math
nx = [int(x) for x in sys.stdin.readline().split()]
instr = [int(x) for x in sys.stdin.readline().split()]
vsum = math.fsum(instr)
result = int(math.fabs(vsum / nx[1]))
if vsum % nx[1] != 0:
	result += 1
print(result)


(n, x) = list(map(int, input().split()))
L = list(map(int, input().split()))
s = sum(L)
s = abs(s)
ans = 0
while s > 0:
	s -= x
	ans += 1
print(ans)


def read_ints():
	return map(int, input().strip().split())
(n, x) = read_ints()
s = abs(sum(read_ints()))
print((s + x - 1) // x)


(n, m) = map(int, input().split(' '))
import math
X = [int(x) for x in input().split(' ')]
if sum(X) == 0:
	print(0)
if sum(X) != 0:
	print(math.ceil(abs(sum(X)) / m))


(n, x) = [int(i) for i in input().split()]
sumsum = 0
for i in input().split():
	sumsum += int(i)
print((abs(sumsum) + x - 1) // x)


l = [int(e) for e in input().split()]
n = l[0]
x = l[1]
s = abs(sum([int(e) for e in input().split()]))
if s == 0:
	print(0)
else:
	z = 1
	while s > x:
		s -= x
		z += 1
	print(z)


r = lambda : map(int, input().split())
(n, m) = r()
s = sum(r())
l = abs(s) // m + bool(s % m)
print(l)


(n, x) = map(int, input().split())
mass = list(map(int, input().split()))
summa = abs(sum(mass))
k = summa // x
if summa % x != 0:
	k += 1
print(k)


from math import fabs, ceil
a = int(input().split()[1])
b = [int(i) for i in input().split()]
print(ceil(fabs(sum(b)) / a))


import math
b = list(map(int, input().split()))
c = list(map(int, input().split()))
s = 0
for x in c:
	s = s + x
s = abs(s)
t = 0
while s > 0:
	t = t + s // b[1]
	s = s % b[1]
	b[1] = b[1] - 1
print(t)


import math
ll = input().split()
n = int(ll[0])
x = int(ll[1])
lll = input().split()
t = lll.__len__()
y = 0
for i in range(t):
	y += int(lll[i])
if y / x < 0:
	y = -y
print(math.ceil(y / x))


import math

def main():
	pass

def __starting_point():
	main()
(n, x) = list(map(int, input().split()))
numbers = list(map(int, input().split()))
s = abs(sum(numbers))
res = math.ceil(s / x)
print(res)
__starting_point()


c = 0
(N, M) = map(int, input().split())
A = [int(i) for i in input().split()]
k = sum(A)
if k % M != 0:
	c += 1
c += abs(k) // M
print(c)


import math
(n, x) = map(int, input().split())
a = list(map(int, input().split()))
if sum(a) == 0:
	print('0')
else:
	s = abs(sum(a))
	print(math.ceil(s / x))


(n, x) = list(map(int, input().split()))
l = list(map(int, input().split()))
s = sum(l)
if s == 0:
	print(0)
elif abs(s) == x:
	print(1)
else:
	s = abs(s) - x
	c = 1
	while s > 0:
		s = abs(s) - x
		c += 1
	print(c)


(n, k) = map(int, input().split())
s = [int(i) for i in input().split()]
d = 0
c = abs(sum(s))
while c > 0:
	c -= k
	d += 1
print(d)


def main():
	pass
main()
(n, x) = map(int, input().split())
numbers = list(map(int, input().split()))
s = abs(sum(numbers))
res = s // x
if s % x != 0:
	res += 1
print(res)


from math import ceil
(n, x) = input().split()
n = int(n)
x = int(x)
a = list(map(int, input().split()))
su = sum(a)
su = abs(su)
cards = ceil(su / x)
print(cards)


import math
string = input().split(' ')
n = int(string[0])
x = int(string[1])
cards = input().split(' ')
sum = 0
for num in cards:
	sum += int(num)
left = abs(0 - sum)
print(math.ceil(left / x))


s = input().split()
(n, x) = (int(s[0]), int(s[1]))
s = input().split()
s_sum = 0
for i in range(n):
	s_sum += int(s[i])
cnt = abs(s_sum)
print(cnt // x if cnt % x == 0 else 1 + cnt // x)


(n, x) = list(map(int, input().split()))
a = list(map(int, input().split()))
sum_a = sum(a)
c = 0
sum_a = abs(sum_a)
while sum_a > x:
	sum_a -= x
	c += 1
if sum_a > 0:
	c += 1
	print(c)
elif sum_a == 0:
	print(c)


import math
st = [int(i) for i in input().split(' ')]
n = st[0]
x = st[1]
s = 0
a = [int(n) for n in input().split(' ')]
for i in range(len(a)):
	s += a[i]
k = math.ceil(abs(s) / abs(x))
print(k)


import math as m
[n, x] = [int(x) for x in input().split()]
s = sum([int(x) for x in input().split()])
print(m.ceil(abs(s) / x))


from math import *

def main():
	(n, x) = map(int, input().split())
	A = abs(sum(list(map(int, input().split()))))
	if A == 0:
		print(0)
		return
	l = 0
	r = 10 ** 8
	while r - l > 1:
		m = (l + r) // 2
		if A - m * x > 0:
			l = m
		else:
			r = m
	print(r)
main()


def main():
	from math import ceil
	[_, x] = [int(_) for _ in input().split()]
	actual_sum = sum([int(_) for _ in input().split()])
	actual_sum = abs(actual_sum)
	result = ceil(actual_sum / x)
	print(result)
main()


(n, x) = [int(i) for i in input().split()]
s = abs(sum([int(i) for i in input().split()]))
k = s // x
if s % x != 0:
	k += 1
print(k)


(a, b) = map(int, input().split())
s = list(map(int, input().split()))
z = abs(sum(s))
if z % b != 0:
	print(z // b + 1)
else:
	print(z // b)


(n, a) = [int(i) for i in input().split()]
p = [int(i) for i in input().split()]
z = abs(sum(p))
t = z // a
if z % a != 0:
	t += 1
print(t)


(n, x) = map(int, input().split())
a = abs(sum(list(map(int, input().split()))))
a = (a + x - 1) // x
print(a)


(n, x) = map(int, input().split())
f = list(map(int, input().split()))
s = sum(f)
if s == 0:
	print(0)
else:
	req = -s
	if req >= -x and req <= x:
		print(1)
	else:
		cnt = 0
		make = abs(req)
		while make > x:
			make = make - x
			cnt = cnt + 1
		print(cnt + 1)


a = list(map(int, input().split()))
b = list(map(int, input().split()))
s = 0
for q in range(len(b)):
	s += b[q]
if s == 0:
	print(0)
elif s > 0:
	t = 0
	while s > 0:
		s -= a[1]
		t += 1
	print(t)
else:
	t = 0
	while s < 0:
		s += a[1]
		t += 1
	print(t)


from math import ceil
(n, x) = map(int, input().split())
cards = [int(c) for c in input().split()]
_sum = sum(cards)
ans = ceil(abs(_sum) / x)
print(ans)


from math import ceil

def main():
	(n, x) = [int(x) for x in input().split()]
	_sum = abs(sum([int(x) for x in input().split()]))
	print(ceil(float(_sum) / x))
main()


(n, x) = map(int, input().split())
a1 = list(map(int, input().split()))
z = sum(a1)
z = abs(z)
if z > 0:
	if -x <= z <= x:
		print(1)
	elif 0 < z % x <= x:
		h = 1
		print(z // x + h)
	else:
		print(z // x)
if z == 0:
	print(0)


def cards(arr, x):
	suma = sum(arr)
	if suma == 0:
		return 0
	if suma < 0:
		suma *= -1
	ans = 0
	while suma > 0:
		suma -= x
		ans += 1
	return ans
(n, x) = list(map(int, input().rstrip().split()))
arr = list(map(int, input().rstrip().split()))
print(cards(arr, x))


from math import ceil
(a, b) = map(int, input().split())
c = list(map(int, input().split()))
print(ceil(abs(sum(c)) / b))


(n, x) = map(int, input().split())
y = [int(q) for q in input().split()]
s = sum(y)
if n == 1:
	if s == 0:
		print(0)
	else:
		print(1)
elif x == 1:
	if s == 0:
		print(0)
	else:
		print(abs(s))
else:
	l = 0
	d = abs(s)
	for i in range(x, 1, -1):
		while d > 0:
			d -= x
			l += 1
	print(l)


(n, x) = map(int, input().split())
li = sum(map(int, input().split()))
count = 0
k = abs(li)
while k > 0:
	k -= x
	count += 1
print(count)


(_, X) = [int(_) for _ in input().split()]
total = sum((int(_) for _ in input().split()))
print((abs(total) + X - 1) // X)


(n, x) = map(int, input().split())
listNum = list(map(int, input().split()))
sumNum = abs(sum(listNum))
print(sumNum // x + (1 if sumNum % x != 0 else 0))


(n, i) = map(int, input().split(' '))
L = list(map(int, input().split(' ')))
b = abs(sum(L))
cont = 0
while b > 0:
	cont += 1
	b -= i
print(cont)


__author__ = 'myduomilia'
(n, k) = map(int, input().split())
arr = list(map(int, input().split()))
s = abs(sum(arr))
ans = 0
while s > 0:
	ans += s // k
	s = s % k
	k -= 1
print(ans)


(n, m) = map(int, input().strip().split()[:2])
k = list(map(int, input().strip().split()[:n]))
p = sum(k)
l = abs(p) // m
if p > 0:
	if p % m == 0:
		print(l)
	else:
		print(l + 1)
elif p < 0:
	if p % m == 0:
		print(l)
	else:
		print(l + 1)
else:
	print(0)


from math import ceil
(n, x) = map(int, input().split())
data = list(map(int, input().split()))
cnt = abs(sum(data))
print(ceil(cnt / x))


import math
from operator import itemgetter

def get_primes(prime_supr):
	is_prime = [0] * 2 + [1] * prime_supr
	for i in range(2, int(math.sqrt(prime_supr)) + 1):
		if is_prime[i]:
			for j in range(i * i, prime_supr + 1, i):
				is_prime[j] = 0
	return is_prime
get_int = lambda : map(int, input().split())
(n, m) = get_int()
a = int(math.fabs(sum(list(get_int()))))
print([a // m, a // m + 1][a % m != 0])


(n, x) = map(int, input().split())
J = sum([int(x) for x in input().split()])
print((abs(J) - 1) // x + 1) if J else print(0)


def main():
	(n, x) = map(int, input().split())
	left = abs(sum(map(int, input().split())))
	print('%s' % ((left - 1) // x + 1))
main()


(n, x) = map(int, input().split())
list1 = list(map(int, input().split()))[:n]
s = sum(list1)
p = 0
if s == 0:
	print(0)
elif abs(s) <= x:
	print(1)
else:
	while abs(s) >= x:
		s = abs(s) - x
		p = p + 1
	if abs(s) > 0 and abs(s) < x:
		p = p + 1
	print(p)


(n, k) = map(int, input().split())
s = abs(sum([int(i) for i in input().split()]))
print((s + k - 1) // k)


import math
(n, x) = input().split()
(n, x) = (int(n), int(x))
M = list(map(int, input().split()))
if sum(M) == 0:
	print(0)
else:
	print(math.ceil(abs(sum(M)) / x))


(n, x) = map(int, input().split())
print((abs(sum(map(int, input().split()))) + x - 1) // x)


(n, x) = map(int, input().split())
s = abs(sum(list(map(int, input().split()))))
print(s // x + int(s % x != 0))


f = lambda : list(map(int, input().split()))
(n, x) = f()
a = f()
s = sum(a)
if s == 0:
	print(0)
elif abs(s) <= x:
	print(1)
elif abs(s) % x == 0:
	print(abs(s) // x)
else:
	print(abs(s) // x + 1)


(n, x) = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
if sum(c) == 0:
	print(0)
elif abs(sum(c)) <= x:
	print(1)
elif abs(sum(c)) % x != 0:
	print(abs(sum(c)) // x + 1)
else:
	print(abs(sum(c)) // x)


(n, x) = map(int, input().split())
l = list(map(int, input().split()))
s = abs(sum(l))
s1 = s // x
ans = s - s // x * x
if ans == 0:
	print(s1)
else:
	print(s1 + 1)


import math
ar = []
for i in input().split(' '):
	ar.append(int(i))
nums = []
for i in input().split(' '):
	nums.append(int(i))
temp = sum(nums)
if temp < 0:
	temp = temp * -1
print(int(math.ceil(temp / ar[1])))


(n, x) = [int(a) for a in input().split()]
found = [int(a) for a in input().split()]
foundsum = sum(found)
print((abs(foundsum) - 1) // x + 1)


import math
i = 0
b = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
k = abs(sum(a))
print(int(math.ceil(k / b[1])))


(n, x) = map(int, input().split())
a = abs(sum(list(map(int, input().split()))))
print(a // x + int(a % x > 0))


(n, x) = map(int, input().split())
ar = map(int, input().split())
summ = sum(ar)
if summ < 0:
	summ = summ * -1
ans = int(summ / x)
if summ % x > 0:
	ans += 1
print(ans)


import math
balance = 0
inn = input()
s = inn.split()
n = int(s[0])
x = int(s[1])
cards = input()
c = cards.split()
for i in range(n):
	balance += int(c[i])
if balance == 0:
	a = 0
else:
	a = math.ceil(abs(balance / x))
print(a)


(n, x) = list(map(int, input().split()))
a = list(map(int, input().split()))
s = sum(a)
count = 0
while -x > s or s > x:
	if s > 0:
		s = s - x
		count += 1
	else:
		s = s + x
		count += 1
if -x <= s <= x and s != 0:
	count += 1
print(count)


import math
(n, x) = map(int, input().split())
arr = list(map(int, input().split()))
print(math.ceil(abs(sum(arr) / x)))


(n, x) = map(int, input().split())
arr = list(map(int, input().split()))
arrsum = abs(sum(arr))
ans = arrsum // x
if arrsum % x != 0:
	ans += 1
print(ans)


import math
(a, b) = map(int, input().split())
l = input().split()
l = [int(i) for i in l]
w = sum(l)
print(math.ceil(abs(w) / b))


(_, x) = map(int, input().split())
print((abs(sum(map(int, input().split()))) - 1) // x + 1)


import math
(n, x) = map(int, input().split())
print(math.ceil(abs(sum([int(y) for y in input().split()])) / x))


(num, x) = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a)
count = 0
while s:
	if s >= x:
		s -= x
		count += 1
	elif s > 0:
		s -= s
		count += 1
	else:
		s = abs(s)
		if s >= x:
			s -= x
			count += 1
		else:
			s -= s
			count += 1
print(count)


f = lambda : map(int, input().split())
(n, x) = f()
s = sum(list(f()))
print((abs(s) + x - 1) // x)


import sys
(n, x) = map(int, sys.stdin.readline().split())
an = list(map(int, sys.stdin.readline().split()))
s = abs(sum(an))
ans = int(s / x)
if s % x != 0:
	ans += 1
print(ans)


res = 0
q = 1
s = input().split()
a = int(s[0])
b = int(s[1])
lst = input().split()
for i in range(a):
	lst[i] = int(lst[i])
	res += lst[i]
if res == 0:
	print(0)
else:
	if res < 0:
		res *= -1
	while True:
		if res <= b:
			print(q)
			break
		else:
			res -= b
			q += 1


(n, x) = input().split()
(n, x) = (int(n), int(x))
s = input()
Sum = 0
for i in s.split():
	Sum = Sum + int(i)
Sum = abs(Sum)
a = int((Sum + x - 1) / x)
print(a)


(x, y) = map(int, input().split())
s = list(map(int, input().split()))
t = 0
t1 = 0
for i in range(x):
	if s[i] <= 0:
		t = t + s[i]
	else:
		t1 = t1 + s[i]
r = -t
if r < t1:
	if (t1 - t) % y != 0:
		print(int((t1 + t) / y) + 1)
	else:
		print(int((t1 + t) / y))
elif (r - t1) % y != 0:
	print(int((r - t1) / y) + 1)
else:
	print(int((r - t1) / y))


import math
(x, y) = input().split()
x = int(x)
y = int(y)
arr = [int(i) for i in input().split()][:x]
for i in range(x):
	arr[i] = int(float(arr[i]))
if sum(arr) == 0:
	print('0')
elif abs(y) >= abs(sum(arr)):
	print('1')
else:
	z = math.ceil(abs(sum(arr)) / abs(y))
	print(z)


import math
(n, x) = map(int, input().split())
a = input()
a = a.rsplit(' ')
sum = 0
temp = 0
for y in range(len(a)):
	sum += int(a[y])
sum = int(math.fabs(sum))
if sum == 0:
	temp = 0
elif sum % x == 0:
	temp += sum // x
elif sum > x:
	temp += sum // x + 1
elif sum < x:
	temp = 1
print(temp)


import math
(n, m) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
d = sum(a)
if d == 0:
	e = abs(m)
	f = abs(d)
	g = f // e
	print(g)
else:
	e = abs(m)
	f = abs(d)
	g = f // e
	h = f % e
	if h > 0:
		print(g + 1)
	else:
		print(g)


(n, m) = map(int, input().split())
a = sum(list(map(int, input().split())))
(counter, x) = (0, -m)
if a > 0:
	while a != 0:
		if a >= m:
			counter += a // m
			a %= m
		m -= 1
elif a < 0:
	while a != 0:
		if a <= x:
			counter += a // x
			a %= x
		x += 1
print(counter)


def single_integer():
	return int(input())

def multi_integer():
	return map(int, input().split())

def string():
	return input()

def multi_string():
	return input().split()
(n, x) = multi_integer()
total_sum = sum(multi_integer())
if total_sum == 0:
	print(0)
elif total_sum > 0:
	ans = 0
	while total_sum > 0:
		total_sum -= x
		ans += 1
	print(ans)
else:
	ans = 0
	while total_sum < 0:
		total_sum += x
		ans += 1
	print(ans)


def main():
	(n, x) = [int(i) for i in input().split()]
	ls = [int(i) for i in input().split()]
	s = sum(ls)
	count = 0
	s = abs(s)
	while s > 0:
		s -= x
		count += 1
	print(count)
	return 0
main()


import math
(n, x) = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
sum_val = sum(A)
print(math.ceil(abs(sum_val) / abs(x)))


(n, m) = map(int, input().split())
x = list(map(int, input().split()))
(t, s) = (0, 0)
for i in range(n):
	t += x[i]
y = abs(t)
while True:
	if y == 0:
		print(0)
		break
	if y > abs(m):
		y -= m
		s += 1
	else:
		print(s + 1)
		break


(x, y) = map(int, input().split())
arr = list(map(int, input().split()))
print((abs(sum(arr)) + y - 1) // y)


(a, b) = map(int, input().split())
c = list(map(int, input().split()))
d = 0
for i in c:
	d += i
e = abs(d) // b
if d % b != 0:
	e += 1
print(e)


(n, x) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
s = sum(a)
s = abs(s)
ans = int(s / x)
if s % x != 0:
	ans += 1
print(ans)


def inp():
	return map(int, input().split())

def arr_inp():
	return [int(x) for x in input().split()]
import math as m
(n, x) = inp()
card = arr_inp()
s = abs(sum(card))
print(m.ceil(s / x))


import sys
from collections import *
from math import *
import re

def sieve(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	c = 0
	for i in range(2, n):
		if prime[i]:
			c += 1
	return c

def iseven(n):
	return [False, True][0 if n % 2 else 1]

def inp_arr():
	return list(map(int, input().split()))

def inp():
	return map(int, input().split())

def lcm(a, b):
	return a * b / gcd(a, b)
max_int = sys.maxsize
mod = 10 ** 9 + 7
(n, x) = inp()
arr = inp_arr()
print(ceil(abs(sum(arr)) / x))


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return [int(x) for x in sys.stdin.readline().split()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def S():
	return input()

def pf(s):
	return print(s, flush=True)

def main():
	(n, x) = LI()
	a = LI()
	s = abs(sum(a))
	return (s + x - 1) // x
print(main())


(n, x) = map(int, input().split(' '))
s = abs(sum([int(x) for x in input().split()]))
ans = (s + x - 1) // x
print(ans)


from math import ceil
(n, x) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
cursum = abs(sum(a))
print(ceil(cursum / x))


from math import ceil as c
(n, x) = map(int, input().split())
l = list(map(int, input().split()))
k = abs(sum(l))
print(c(k / x))


from math import ceil
(n, l) = list(map(int, input().split()))
arr = list(map(int, input().split()))
sum = 0
for i in range(n):
	sum = sum + arr[i]
print(ceil(abs(sum / l)))


import math
(n, x) = map(int, input().split())
l = list(map(int, input().split()))
for i in l:
	if -i in l:
		if i != 0:
			l.remove(i)
			l.remove(-i)
c = 0
if abs(sum(l)) > x:
	c = math.ceil(abs(sum(l)) / x)
elif len(l) == 0 or sum(l) == 0:
	c = 0
else:
	c = 1
print(c)


(n, x) = map(int, input().split())
cardList = [int(ch) for ch in input().split()]
s = abs(sum(cardList))
ans = int(s / x)
if s % x != 0:
	ans += 1
print(ans)


import math
string = input()
numbers = string.split(' ')
a = int(numbers[0])
b = int(numbers[1])
string = input()
numbers = string.split(' ')
for x in range(a):
	numbers[x] = int(numbers[x])
print(math.ceil(abs(sum(numbers)) / b))


s = [int(n) for n in input().split()]
z = [int(n) for n in input().split()]
n = s[0]
x = s[1]
m = sum(z)
if m == 0:
	print(0)
else:
	v = abs(m)
	if v % x == 0:
		print(int(v / x))
	else:
		print(int(v / x) + 1)


(n, x) = map(int, input().split())
l = [*map(int, input().split())]
sum_l = abs(sum(l))
a = 0
for i in range(x, 0, -1):
	if sum_l == 0:
		break
	d = sum_l // i
	a += d
	sum_l -= i * d
print(a)


(n, x) = map(int, input().split())
found = list(map(int, input().split()))
foundsum = sum(found)
print((abs(foundsum) - 1) // x + 1)


(n, x) = map(int, input().split())
a = list(map(int, input().split()))
val = abs(sum(a)) // x
if abs(sum(a)) % x > 0:
	val += 1
print(val)


(n, x) = map(int, input().split())
nos = list(map(int, input().split()))
add = sum(nos)
count = 0
while add != 0:
	if add > x:
		add = add - x
		count += 1
	elif add < -x:
		add = add + x
		count += 1
	else:
		add = 0
		count += 1
print(count)


(n, x) = input().split()
n = int(n)
x = int(x)
a = list(map(int, input().split()))
cnt = 0
for i in a:
	cnt += i
if cnt == 0:
	print('0')
else:
	if cnt < 0:
		cnt = -cnt
	p = cnt // x
	q = cnt / x
	if p == q:
		print(p)
	else:
		print(p + 1)


(n, x) = list(map(int, input().split(' ')))
sum_cards = sum(list(map(int, input().split(' '))))
if sum_cards < 0:
	sum_cards *= -1
answer = sum_cards // x
if sum_cards % x != 0:
	answer += 1
print(answer)


(n, x) = map(int, input().split())
l = list(map(int, input().split()))
sum = abs(sum(l))
print(sum // x + (sum % x > 0))


(a, b) = map(int, input().split())
ar = list(map(int, input().split()))
count = 0
count1 = 0
for i in ar:
	if i < 0:
		count += abs(i)
	else:
		count1 += abs(i)
t = abs(count - count1)
m = 0
while t > 0:
	if t - b >= 0:
		t = t - b
		m += 1
	else:
		b -= 1
print(m)


from math import ceil
(n, k) = [int(i) for i in input().split()]
arr = [int(i) for i in input().split()]
s = abs(sum(arr))
k = abs(k)
print(ceil(s / k))


(n, m) = map(int, input().split())
g = abs(sum(list(map(int, input().split()))))
print(g // m + bool(g % m))


(n, x) = input('').split(' ')
cartas = [int(x) for x in input('').split(' ')]
soma = abs(sum(cartas))
cont = int(x)
quantCarta = 0
while cont >= 1:
	calculo = soma // cont
	soma -= calculo * cont
	cont -= 1
	quantCarta += calculo
print(quantCarta)


(n, x) = map(int, input().split())
numbers = list(map(int, input().split()))
s = abs(sum(numbers))
res = s // x
if s % x != 0:
	res += 1
print(res)


import math

def main():
	(n, x) = [int(i) for i in input().split()]
	cards = [int(i) for i in input().split()]
	print(math.ceil(abs(sum(cards)) / x))
main()


from math import *
(n, x) = map(int, input().split())
a = list(map(int, input().split()))
summa = 0
for i in a:
	summa += i
print(ceil(abs(summa) / x))


from math import ceil
q = lambda : map(int, input().split())
(n, x) = q()
c = sum(q())
if c == 0:
	print(0)
elif abs(c) <= x:
	print(1)
else:
	print(ceil(abs(c) / x))


import math
firstLine = [int(x) for x in input().split()]
secondLine = [int(x) for x in input().split()]
x = firstLine[1]
total = 0
for i in secondLine:
	total += i
print(math.ceil(abs(total) / x))


(q, max) = map(int, input().split())
n = input().split()
a = []
for x in n:
	a.append(int(x))
aux = max
soma = abs(sum(a))
quant = 0
while True:
	while soma - aux >= 0:
		quant += 1
		soma -= aux
	while soma - aux < 0:
		aux -= 1
	if soma == 0:
		break
print(quant)


(n, m) = map(int, input().split())
c = list(map(int, input().split()))
s = abs(sum(c))
print((s - 1) // m + 1)


datos = list(str(input()).split())
cartas = list(str(input()).split())
suma = 0
total = 0
datos[0] = int(datos[0])
datos[1] = int(datos[1])
for i in range(len(cartas)):
	cartas[i] = int(cartas[i])
for i in cartas:
	suma += i
if suma == 0:
	total = 0
else:
	if suma < 0:
		suma *= -1
	if suma > datos[1]:
		if suma % datos[1] == 0:
			total += suma // datos[1]
		else:
			total += suma // datos[1] + 1
	else:
		total += 1
print(total)


import math
x = int(input().split()[1])
arr = input().split()
arr = list(map(int, arr))
sum = 0
for a in arr:
	sum += a
sum = abs(sum)
print(math.ceil(sum / x))


(a, b) = map(int, input().split())
l = list(map(int, input().split()))
s = sum(l)
k = 0
while s != 0:
	if s > 0 and s >= b:
		s -= b
		k += 1
	elif s < 0 and s + b <= 0:
		s += b
		k += 1
	else:
		break
if s == 0:
	print(k)
else:
	print(k + 1)


(n, x) = [int(x) for x in input().split()]
print((abs(sum((int(x) for x in input().split()))) + x - 1) // x)


import math
(n, k) = map(int, input().split())
a = list(map(int, input().split()))
x = sum(a)
x = abs(x)
y = math.ceil(x / k)
print(abs(y))


(n, x) = map(int, input().split())
l = list(map(int, input().split()))
print((abs(sum(l)) - 1) // x + 1)


import math
(n, x) = map(int, input().split())
A = list(map(int, input().split()))
suma = sum(A)
diff = abs(suma)
ans = math.ceil(diff / x)
print(ans)


import math
(n, x) = map(int, input().split(' '))
list1 = sum(list(map(int, input().split(' '))))
ct = 0
while list1:
	if list1 > 0:
		list1 -= x
		ct += 1
		if list1 <= 0:
			break
	if list1 < 0:
		list1 += x
		ct += 1
		if list1 >= 0:
			break
print(ct)


from sys import stdin, stdout
input = stdin.readline
(n, x) = map(int, input().split())
a = list(map(int, input().split()))
s = abs(sum(a))
ans = 0
while s > 0:
	if s <= x:
		ans += 1
		s = 0
	else:
		s -= x
		ans += 1
stdout.write(str(ans))


import math
(n, x) = map(int, input().split(' '))
li = list(map(int, input().split(' ')))
y = 0 - sum(li)
if y == 0:
	print(0)
elif abs(y) > x:
	print(math.ceil(abs(y) / x))
else:
	print(1)


from math import *
(n, x) = map(int, input().split())
li = list(map(int, input().split()))
s = sum(li)
ans = ceil(abs(s) / x)
print(ans)


(n, x) = map(int, input().split())
a = list(map(int, input().split()))
k = 0
s1 = sum(a)
s = abs(s1)
while s > 0:
	s -= x
	k += 1
print(k)


import math
(n, k) = map(int, input().split())
l = list(map(int, input().split()))
print(math.ceil(abs(sum(l)) / k))


from math import ceil
(n, x) = map(int, input().split())
cards = [int(x) for x in input().split()]
s = sum(cards)
print(ceil(abs(s) / x))


import math
(n, x) = map(int, input().split())
a = [int(x) for x in input().split()]
su = sum(a)
req = math.ceil(abs(su) / x)
print(req)


(n, x) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
s = 0
for i in a:
	s += i
if s % x != 0:
	print(abs(s) // x + 1)
else:
	print(abs(s) // x)


import math
(foundCards, maximumValue) = [int(x) for x in input().split()]
cardList = [int(x) for x in input().split()]
summation = abs(sum(cardList))
print(math.ceil(summation / maximumValue))


import math
(n, x) = map(int, input().split())
a = list(map(int, input().split()))
print(math.ceil(math.fabs(sum(a)) / x))


def cards(x, lst):
	return (abs(sum(lst)) + x - 1) // x
(N, X) = [int(i) for i in input().split()]
a = [int(j) for j in input().split()]
print(cards(X, a))


(n, x) = map(int, input().split())
n_list = list(map(int, input().split()))
n_sum = abs(sum(n_list))
ans = n_sum // x
if n_sum % x != 0:
	ans += 1
print(ans)


t = input().split()
n = int(t[0])
r = int(t[1])
t = [int(x) for x in input().split()]
temp = sum(t)
print(abs(temp) // r + (0 if abs(temp) % r == 0 else 1))


(n, x) = map(int, input().split())
total = abs(sum(map(int, input().split())))
print(total // x + (total % x > 0))


(n, x) = map(int, input().split())
A = list(map(int, input().split()))
re = abs(sum(A))
if re % x == 0:
	print(re // x)
else:
	print(re // x + 1)


from math import ceil
a = input().split()
print(ceil(abs(sum(list(map(int, input().split())))) / int(a[1])))


a = input().split()
b = input().split()
mx = int(a[1])
s = 0
for i in range(len(b)):
	s = s + int(b[i])
if s < 0:
	s = s * -1
p = s // mx
if s % mx == 0:
	print(p)
else:
	print(p + 1)


(n, x) = [int(x) for x in input().split()]
cards = [int(x) for x in input().split()]
s = abs(sum(cards))
if s % x == 0:
	print(s // x)
else:
	print(s // x + 1)


(n, x) = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
s = sum(l)
print(abs(s) // x + int(s % x != 0))


(N, X) = map(int, input().split())
L = list(map(int, input().split()))
print(int(abs(sum(L)) / X) + bool(abs(sum(L)) % X))


(n, x) = map(int, input().split())
a = list(map(int, input().split()))
s = abs(sum(a))
cards = 0
if s % x == 0:
	cards += s // x
else:
	cards += s // x + 1
print(cards)


from sys import stdin, stdout
(n, x) = map(int, stdin.readline().split())
s = sum(map(int, stdin.readline().split()))
stdout.write(str((abs(s) + x - 1) // x))


num = input()
A = list(map(int, num.split(' ')))
n = A[0]
x = A[1]
A = input()
A = list(map(int, A.split(' ')))
su = abs(sum(A))
t = su // x
if su % x != 0:
	t = t + 1
print(t)


import math
maxValue = int(input().split()[1])
cards = [int(x) for x in input().split()]
diff = abs(sum(cards))
cardCount = math.floor(diff / maxValue)
if cardCount * maxValue < diff:
	cardCount += 1
print(cardCount)


(n, x) = [int(i) for i in input().split()]
S = [int(i) for i in input().split()]
k = 0
for i in S:
	k += i
n = abs(k) // x
if k % x != 0:
	n += 1
print(n)


inp = input().split(' ')
n = int(inp[0])
x = int(inp[1])
su = 0
inp = input().split(' ')
for i in inp:
	su += int(i)
count = 0
while su != 0:
	count += 1
	if su > 0:
		su += max(-x, -su)
	else:
		su += min(x, -su)
print(count)


(n, x) = map(int, input().split())
li = list(map(int, input().split()))
sm = abs(sum(li))
print(sm // x + (sm % x > 0))


(n, x) = map(int, input().split())
l = [int(i) for i in input().split()]
sum = 0
for i in l:
	sum += i
sum = abs(sum)
ans = int(sum / x)
if sum % x != 0:
	ans += 1
print(ans)


(Found, Abs) = list(map(int, input().split()))
Y = list(map(int, input().split()))
if sum(Y) != 0:
	Count = 0
	Val_now = Abs
	Diff = abs(sum(Y))
	while Diff != 0 and Val_now > 0:
		if Diff >= Val_now:
			Count += int(Diff / Val_now)
			Diff = Diff % Val_now
		Val_now -= 1
	print(Count)
else:
	print(0)


def main():
	(n, x) = list(map(int, input().split()))
	a = list(map(int, input().split()))
	s = sum(a)
	k = 0
	c = x
	while s != 0:
		if s > 0:
			if abs(s) >= abs(c):
				s = s - c
				k = k + 1
			else:
				c = c - 1
		elif s < 0:
			if abs(s) >= abs(c):
				s = s + c
				k = k + 1
			else:
				c = c - 1
	print(k)
main()


(n, x) = map(int, input().split())
nums = list(map(int, input().split()))
dif = sum(nums)
cards = 0
while dif != 0:
	if dif > 0:
		if dif > x:
			dif -= x
			cards += 1
		if dif <= x:
			for i in range(x, 0, -1):
				if dif - i == 0:
					dif -= i
					cards += 1
	elif dif < -x:
		dif += x
		cards += 1
	else:
		for i in range(x, 0, -1):
			if dif + i == 0:
				dif += i
				cards += 1
print(cards)


def solve(n, x, a):
	k = sum(a)
	if k == 0:
		return 0
	else:
		return abs(k) // x + (1 if abs(k) % x != 0 else 0)

def main():
	(n, x) = list(map(int, input().split()))
	a = list(map(int, input().split()))
	print(solve(n, x, a))
main()


import math

def cardslost(n, x, l):
	s = abs(sum(l))
	if s == 0:
		return 0
	if s <= x:
		return 1
	return math.ceil(s / x)
a = input().split()
n = int(a[0])
x = int(a[1])
l = list(map(int, input().split()))
print(cardslost(n, x, l))


(n, x) = (int(x) for x in input().split())
a = [int(x) for x in input().split()]
sum = 0
for i in a:
	sum += i
sum = abs(sum)
print((sum + x - 1) // x)


(a, b) = map(int, input().split())
c = abs(sum(map(int, input().split())))
print([c // b, c // b + 1][c % b != 0])


[n, x] = list(map(int, input().split(' ')))
n = sum(list(map(int, input().split(' '))))
n = max(n, -n)
n = n // x + (1 if n % x > 0 else 0)
print(n)


(n, m) = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
print(abs(sum(l)) // m + min(1, abs(sum(l)) % m))


from sys import stdin, stdout
from math import gcd, ceil, sqrt
ii1 = lambda : int(stdin.readline().strip())
is1 = lambda : stdin.readline().strip()
iia = lambda : list(map(int, stdin.readline().strip().split()))
isa = lambda : stdin.readline().strip().split()
mod = 1000000007
(n, x) = iia()
tot = abs(sum(iia()))
if tot % x == 0:
	print(tot // x)
else:
	print(tot // x + 1)


import math
(n, x) = map(int, input().split())
l = list(map(int, input().split()))
sum = 0
for i in l:
	sum += i
sum = abs(sum)
print(math.ceil(sum / x))


from math import ceil
t = list(map(int, input().split()))
n = t[0]
x = t[1]
c = list(map(int, input().split()))
yo = sum(c)
if abs(yo) <= abs(x):
	if yo == 0:
		print(0)
	else:
		print(1)
else:
	print(ceil(abs(yo) / x))


(n, x) = map(int, input().split())
li = list(map(int, input().split()))
ans = 0
while sum(li) != 0:
	if abs(sum(li)) <= x:
		ans += 1
		li.append(sum(li) * -1)
	else:
		ans += 1
		if sum(li) > 0:
			li.append(-x)
		else:
			li.append(x)
print(ans)


(a, b) = map(int, input().split())
im = [int(i) for i in input().split()]
a = sum(im)
if a == 0:
	print('0')
elif a < 0:
	a = -a
if a <= b and a != 0:
	print('1')
elif a > b:
	if a % b == 0:
		print(a // b)
	else:
		ans = a // b + 1
		print(ans)


import math
(n, x) = [int(kuy) for kuy in input().split()]
s = sum([int(a) for a in input().split()])
s = abs(s)
print(math.ceil(s / x))


n = list(map(int, input().split()))
x = list(map(int, input().split()))
count = 0
for i in x:
	count += i
if count == 0:
	print(0)
elif abs(count) > n[1]:
	print(abs(count) // n[1] if abs(count) % n[1] == 0 else abs(count) // n[1] + 1)
else:
	print(1)


lista = []
entrada1 = input().split()
entrada12 = input().split()
soma = 0
for i in range(len(entrada12)):
	soma = soma + int(entrada12[i])
fim = 0
soma = abs(soma)
while True:
	if soma > 0:
		soma = soma - int(entrada1[1])
		fim = fim + 1
	else:
		break
print('%i' % fim)


import math
(n, x) = map(int, input().split())
a = list(map(int, input().split()))
b = abs(sum(a))
res = math.ceil(b / x)
print(res)


(n, m) = list(map(int, input().split()))
l = list(map(int, input().split()))
count = 0
sum1 = sum(l)
if sum1 == 0:
	print(0)
elif sum1 != 0:
	if abs(sum1) % m == 0:
		print(abs(sum1) // m)
	elif abs(sum1) % m != 0:
		print(abs(sum1) // m + 1)


(n, x) = str(input()).split()
n = int(n)
x = int(x)
line = str(input()).split()
line = [int(it) for it in line]
miss = abs(sum(line))
print((miss + x - 1) // x)


import sys
input = sys.stdin.readline
(n, x) = list(map(int, input().split()))
a = abs(sum(list(map(int, input().split()))))
c = a // x
if a % x != 0:
	c += 1
print(c)


(n, m) = map(int, input().split())
li = list(map(int, input().split()))
x = 0
for i in range(n):
	x += li[i]
x = abs(x)
print(x // m + (x % m > 0))


def solve(arr, x, n):
	tot = abs(sum(arr))
	return tot // x + (1 if tot % x > 0 else 0)

def main():
	(n, x) = list(map(int, input().split(' ')))
	arr = list(map(int, input().split(' ')))
	print(solve(arr, x, n))
main()


(n, x) = map(int, input().split())
a = abs(sum(list(map(int, input().split()))))
ch = x
cointt = 0
while a > 0:
	cointt += 1
	a = a - ch
print(cointt)


inp = input().split(' ')
cards_found = int(inp[0])
upper_bound = int(inp[1])
inp = input().split(' ')
s = 0
for i in inp:
	s += int(i)
s = abs(s)
ans = s / upper_bound
if ans > s // upper_bound:
	ans = s // upper_bound + 1
print(round(ans))


(a, ma) = input().split()
(a, ma) = (int(a), int(ma))
c = [int(x) for x in input().split()]
sm = 0
for x in c:
	sm += x
sm = abs(sm)
if sm / ma != int(sm / ma):
	res = int(sm / ma) + 1
else:
	res = int(sm / ma)
print(res)


import math
import sys
import collections

def getdict(n):
	d = {}
	if type(n) is list:
		for i in n:
			if i in d:
				d[i] += 1
			else:
				d[i] = 1
	else:
		for i in range(n):
			t = ii()
			if t in d:
				d[t] += 1
			else:
				d[t] = 1
	return d

def cdiv(n, k):
	return n // k + (n % k != 0)

def ii():
	return int(input())

def mi():
	return map(int, input().split())

def li():
	return list(map(int, input().split()))

def lcm(a, b):
	return abs(a * b) // math.gcd(a, b)
(n, x) = mi()
a = sum(li())
print(cdiv(abs(a), x))


__author__ = 'Dilshod'
(n, m) = map(int, input().split())
a = list(map(int, input().split()))
a = abs(sum(a))
if a == 0:
	print(0)
	exit()
if m >= a:
	print(1)
	exit()
cnt = a // m
if a % m != 0:
	cnt += 1
print(cnt)


import math
(n, x) = input().split()
a = [int(x) for x in input().split()]
sum = 0
for i in range(0, int(n)):
	sum += a[i]
Ans = 0
y = -sum
y = abs(y)
x = int(x)
if y > x:
	while y > x:
		y -= x
		Ans += 1
if y:
	Ans += 1
print(Ans)


(n, x) = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
y = sum(l)
r = -1 * y
if abs(r) > x:
	if r % x == 0:
		r = abs(int(r / x))
	else:
		r = abs(int(r / x)) + 1
	print(r)
elif r == 0:
	print(0)
else:
	print(1)


(n, x) = map(int, input().split())
a = list(map(int, input().split()))
s = abs(sum(a))
num = 0
while s != 0:
	if s >= x:
		num += 1
		s = s - x
	else:
		num += 1
		break
print(num)


(n, m) = map(int, input().split())
l = list(map(int, input().split()))
c = 0
s = sum(l)
s = abs(s)
c = s / m
if s % m != 0:
	c += 1
print(int(c))


(n, x) = map(int, input().split())
A = list(map(int, input().split()))
print((abs(sum(A)) + x - 1) // x)


line = input().split(' ')
n = int(line[0])
x = float(line[1])
num = input().split(' ')
sum = 0
i = 0
while i < n:
	sum += int(num[i])
	i += 1
ans = abs(float(sum)) // x
if abs(float(sum)) / x > ans:
	print(int(ans + 1))
else:
	print(int(ans))


(a, b) = map(int, input().split())
c = list(map(int, input().split()))
d = abs(sum(c))
print(d // b if d % b == 0 else d // b + 1)


(n, x) = map(int, input().split())
a = abs(sum(map(int, input().split())))
cnt = 0
while a > 0:
	cnt += 1
	a -= x
print(cnt)


(n, k) = map(int, input().split())
print((abs(sum(map(int, input().split()))) + k - 1) // k)


(n, x) = input().split()
n = int(n)
x = int(x)
a = [int(i) for i in input().split()]
sm = 0
for i in range(n):
	sm += a[i]
if sm < 0:
	sm = -sm
if sm <= x:
	if sm > 0:
		print(1)
	else:
		print(0)
else:
	cnt = sm // x
	if sm % x > 0:
		cnt += 1
	print(cnt)


(n, k) = map(int, input().split())
s = abs(sum(list(map(int, input().split()))))
if s % k == 0:
	print(s // k)
else:
	print(s // k + 1)


(n, x) = map(int, input().strip().split())
s = abs(sum(map(int, input().strip().split())))
print((s + x - 1) // x)


(a, b) = map(int, input().split())
ar = list(map(int, input().split()))
print((abs(sum(ar)) + b - 1) // b)


(a, b) = list(map(int, input().split()))
inplist = list(map(int, input().split()))
sum = 0
for x in inplist:
	sum += x
sum = abs(sum)
output = sum / b
if output % 1 != 0:
	output = sum // b + 1
print(int(output))


(n, x) = map(int, input().split())
a = list(map(int, input().split()))
s = abs(sum(a))
c = s // x
if s % x != 0:
	c += 1
print(c)


a = [int(i) for i in input().split(' ')]
n = a[0]
maxi = a[1]
a = [int(i) for i in input().split(' ')]
c = 0
s = sum(a)
while s != 0:
	if s <= maxi and s >= -maxi:
		c += 1
		s = 0
	elif s > maxi:
		c += 1
		s -= maxi
	elif s < -maxi:
		c += 1
		s += maxi
print(c)


import math
(n, x) = [int(s) for s in input().split(' ')]
cards = [int(s) for s in input().split(' ')]
ans = math.ceil(abs(sum(cards)) / x)
print(ans)


(n, x) = map(int, input().split())
l = list(map(int, input().split()))
import math as m
print(m.ceil(abs(sum(l)) / x))


from math import ceil
(n, m) = map(int, input().split())
l = list(map(int, input().split()))
s = abs(sum(l))
q = max(abs(max(l)), abs(min(l)))
print(ceil(s / m))


import sys
import math
get_string = lambda : sys.stdin.readline().strip()
get_int_list = lambda : list(map(int, sys.stdin.readline().strip().split()))
get_intList_from_str = lambda : list(map(int, list(sys.stdin.readline().strip())))
get_charList_from_str = lambda : list(sys.stdin.readline().strip())
get_char_list = lambda : sys.stdin.readline().strip().split()
get_int = lambda : int(sys.stdin.readline())
pt = lambda x: sys.stdout.write(str(x))
(n, m) = get_int_list()
s = sum(get_int_list())
ans = abs(s) // m
if s % m != 0:
	ans += 1
print(ans)


import math
import functools
(n, x) = list(map(int, input().split(' ')))
print(math.ceil(abs(functools.reduce(lambda a, b: a + b, list(map(int, input().split(' '))))) / x))


from math import ceil
(n, m) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
s = abs(sum(a))
print(ceil(s / m))


import sys
import math
import bisect
import itertools
import random

def main():
	(n, m) = map(int, input().split())
	A = list(map(int, input().split()))
	ans = math.ceil(abs(sum(A)) / m)
	print(ans)
main()


(n, m) = map(int, input().split())
s = 0
a = list(map(int, input().split()))
for i in a:
	s += i
if s == 0:
	print('0')
else:
	c = 0
	s = abs(s)
	while s >= m:
		s -= m
		c += 1
	if s > 0:
		c += 1
	print(c)


(n, x) = (int(i) for i in input().split())
tot = abs(sum((int(i) for i in input().split())))
cards = tot // x
if tot % x != 0:
	cards += 1
print(cards)


(n, x) = map(int, input().split())
l = list(map(int, input().split()))
su = abs(sum(l))
if su % x == 0:
	print(su // x)
else:
	print(su // x + 1)


(a, b) = map(int, input().split())
c = list(map(int, input().split()))
print((abs(sum(c)) - 1) // b + 1)


(n, x) = [int(x) for x in input().split()]
cards = [int(x) for x in input().split()]
total = 0
for card in cards:
	total += card
total = abs(total)
res = int(total / x)
if total % x != 0:
	res += 1
print(res)


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
ans = 0
a1 = sum(a)
if a1 > 0:
	while a1 > 0:
		a1 -= k
		ans += 1
else:
	while a1 < 0:
		a1 += k
		ans += 1
print(ans)


(n, maxi) = map(int, input().split(' '))
arr = [int(i) for i in input().split(' ')]
sum = abs(sum(arr))
i = 0
while sum > 0:
	sum -= maxi
	i += 1
print(i)


(n, x) = map(int, input().split())
arr = list(map(int, input().split()))
summ = abs(sum(arr))
if summ % x == 0:
	print(summ // x)
else:
	print(summ // x + 1)


import math
(n, x) = map(int, input().split())
a = list(map(int, input().split()))
z = sum(a)
print(math.ceil(abs(0 - z) / x))


from math import ceil as c
(a, b) = map(int, input().split())
l = list(map(int, input().split()))
j = sum(l)
if j < 0:
	print(c(-j / b))
elif j >= 0:
	print(c(j / b))


import sys
f = sys.stdin
(n, x) = map(int, f.readline().split())
a = abs(sum(map(int, f.readline().strip().split())))
i = 0
while a > 0:
	a -= x
	i += 1
print(i)


(a, b) = map(int, input().split())
c = abs(sum(map(int, input().split())))
print(c // b + 1 if c % b else c // b)


import math
arr = input().split()
n = int(arr[0])
x = int(arr[1])
arr = input().split()
sum = 0
for ch in arr:
	sum += int(ch)
n = math.ceil(abs(sum) / x)
print(str(n))


import math
sa = input().split(' ')
sa2 = input().split(' ')
sa3 = [int(element) for element in sa2]
sumx = sum(sa3)
print(math.ceil(abs(sumx) / int(sa[1])))


import math
c = list(map(int, input().split()))
d = list(map(int, input().split()))
s = math.ceil(math.fabs(sum(d) / c[1]))
print(s)


from math import ceil
(n, m) = (int(x) for x in input().split())
print(ceil(abs(sum([int(x) for x in input().split()])) / m))


import math
ab = input().split()
a = int(ab[0])
b = int(ab[1])
cards = list(map(int, input().split()))
ans = abs(sum(cards)) // b
extra = abs(sum(cards)) % b
extra = math.ceil(extra / b)
print(ans + extra)


import sys
import math

def main():
	(n, x) = map(int, sys.stdin.readline().strip().split())
	card = list(map(int, sys.stdin.readline().strip().split()))
	s = sum(card)
	print(math.ceil(abs(s) / x))
main()


(n, x) = map(int, input().split())
e = list(map(int, input().split()))
q = 0
for i in range(0, n):
	q = q + e[i]
if q % x == 0:
	print(abs(q) // x)
else:
	print(abs(q) // x + 1)


from collections import deque, Counter
import array
from itertools import combinations, permutations
from math import sqrt

def read_int():
	return int(input().strip())

def read_int_array():
	return [int(i) for i in input().strip().split(' ')]
(n, x) = read_int_array()
arr = read_int_array()
y = sum(arr)
print(abs(y) // x + (1 if y % x > 0 else 0))


_input_ = input()
_input__ = _input_.strip().split()
number_of_cards = int(_input__[0])
limit = int(_input__[1])
input_ = input()
cards_found = input_.strip().split()
sum_ = 0
ans = 0
for i in range(0, len(cards_found)):
	sum_ = sum_ + int(cards_found[i])
if sum_ < 0:
	positive_sum = -sum_
else:
	positive_sum = sum_
if positive_sum == 0:
	ans = 0
elif positive_sum % limit == 0:
	ans = int(positive_sum / limit)
else:
	ans = int(positive_sum / limit) + 1
print(ans)


(n, x) = map(int, input().split())
cards = list(map(int, input().split()))
summa = 0
for i in range(n):
	summa = summa + cards[i]
print((abs(summa) + x - 1) // x)


(_, x) = [int(_) for _ in input().split()]
cards = [int(_) for _ in input().split()]
cards_sum = abs(sum(cards))
print(cards_sum // x + int(cards_sum % x != 0))


(n, x) = map(int, input().split())
y = list(map(int, input().split()))
s = sum(y)
count = 0
while s != 0:
	if abs(s) <= x:
		count += 1
		break
	elif s > x:
		s = s - x
		count += 1
		continue
	elif s < -x:
		s = s + x
		count += 1
		continue
print(count)


(n, x) = map(int, input().split())
s = input().split()
count = 0
j = 0
for i in s:
	count += int(i)
if count < 0:
	while count < 0:
		count += x
		j += 1
	print(j)
elif count > 0:
	while count > 0:
		count -= x
		j += 1
	print(j)
else:
	print(0)


(n, x) = map(int, input().split())
a = input().split()
k = 0
for i in range(n):
	k += int(a[i])
print((abs(k) - 1) // x + 1)


import math, itertools, fractions, heapq, collections, bisect, sys, queue, copy
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return [int(x) for x in sys.stdin.readline().split()]

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def LS():
	return sys.stdin.readline().split()

def S():
	return input()

def main():
	(n, m) = LI()
	l = LI()
	sm = abs(sum(l))
	return (sm + m - 1) // m
print(main())


(n, x) = map(int, input().split())
arr = list(map(int, input().split()))
su = abs(sum(arr))
if su == 0:
	print(0)
elif su % x == 0:
	print(su // x)
else:
	print(su // x + 1)


import sys
from math import ceil

def main():
	(_, m, *l) = map(int, sys.stdin.read().strip().split())
	return int(ceil(abs(sum(l)) / m))
print(main())


import math, os, sys
import string, re
from itertools import *
from collections import Counter
from operator import mul

def inputint():
	return int(input())

def inputarray(func=int):
	return map(func, input().split())

def inputarray2(n, func=int):
	for _ in range(n):
		yield func(input())
(n, x) = inputarray()
print((abs(sum(inputarray())) + x - 1) // x)


ent = input().split()
n = int(ent[0])
x = int(ent[1])
total = sum([int(x) for x in input().split()])
res = abs(int(total / x))
if total % x > 0:
	res += 1
print(res)


import math
(a, b) = map(int, input().split())
l = []
l.extend(map(int, input().split()))
c = 0
x = int(math.fabs(sum(l)))
if x > b:
	while x > b:
		x -= b
		c += 1
	else:
		c += 1
elif not x:
	print(0)
else:
	print(1)
if c:
	print(c)


import math
(n, k) = input().split(' ')
s = math.fabs(sum([int(x) for x in input().split(' ')]))
print(int(math.ceil(s / int(k))))


(n, x) = (int(i) for i in input().split())
s = abs(sum((int(i) for i in input().split())))
print((s + x - 1) // x)


(n, x) = map(int, input().split())
total = abs(sum(map(int, input().split())))
import math
print(math.ceil(total / x))


(n, x) = map(int, input().split())
s = sum(map(int, input().split()))
s = abs(s)
print(abs(s // x) + (s / x != round(s / x)))


(n, x) = [int(i) for i in input().split()]
xi = [int(x) for x in input().split()]
s = sum(xi)
s = abs(s)
cnt = 0
for i in range(x, -1, -1):
	if s <= 0:
		print(cnt)
		break
	if s > i:
		q = s // i
		s -= i * q
		cnt += q
	else:
		s -= i
		cnt += 1


(_, x) = list(map(int, input().split()))
cl = list(map(int, input().split()))
ss = -sum(cl)
ss = ss if ss > 0 else -ss
print((ss + x - 1) // x)


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
s = sum(l)
if s == 0:
	print('0')
elif s < 0:
	m = k
	c = 0
	while m != 0 and s != 0:
		if s + m > 0:
			m -= 1
		elif s + m == 0 or s + m < 0:
			s += m
			c += 1
	print(c)
else:
	m = -k
	c = 0
	while m != 0 and s != 0:
		if s + m < 0:
			m += 1
		elif s + m == 0 or s + m > 0:
			s += m
			c += 1
	print(c)


(n, x) = map(int, input().split())
entrada = input().split()
b = 0
cont = 0
for i in range(n):
	b += int(entrada[i])
while b != 0:
	if b > 0:
		if b - x > 0:
			b -= x
		else:
			b = 0
		cont += 1
	else:
		if b + x < 0:
			b += x
		else:
			b = 0
		cont += 1
print(cont)


(n, m) = map(int, input().split())
a = list(map(int, input().split()))
lol = sum(a)
print((abs(lol) + m - 1) // m)


from sys import stdin

def main():
	(n, x) = map(int, stdin.readline().strip().split())
	tot = abs(sum(map(int, stdin.readline().strip().split())))
	return (tot + x - 1) // x
print(main())


(n, k) = map(int, input().split())
j = list(map(int, input().split()))
sum = abs(sum(j))
print(sum // k + (sum % k > 0))


(n, x) = map(int, input().split())
a = [int(i) for i in input().split()]
k = 0
h = 0
for i in range(n):
	k += a[i]
while abs(k) > x:
	k = abs(k) - x
	h += 1
if k:
	print(h + 1)
else:
	print(0)