Problem:
 Score : 100 points    Problem Statement We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2 ?      Constraints  All values in input are integers.  1 \leq B \leq A \leq 20  1 \leq C \leq 20         Input Input is given from Standard Input in the following format:  A  B  C       Output Print the integer representing the amount of water, in milliliters, that will remain in Bottle 2 .        Sample Input 1 6 4 3      Sample Output 1 1  We will transfer two milliliters of water from Bottle 2 to Bottle 1 , and one milliliter of water will remain in Bottle 2 .       Sample Input 2 8 3 9      Sample Output 2 4       Sample Input 3 12 3 7      Sample Output 3 0

Solution (Python):
"""
AtCoder
    :author: vierbein
"""
from __future__ import absolute_import, division, print_function



import sys


def pp(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)


A, B, C = map(int, input().split())
print(max(0, C - A + B))

Solution (Python):
A,B,C = map(int,input().split())
if C < A-B:
    C = A-B
    
print(C-A+B)

Solution (Python):
A, B, C = map(int, input().split())
diff = C-(A-B)
if diff<0:
    diff =0
print(diff)

Solution (Python):
A, B, C = map(int, input().split())

ans = C - (A - B) if C - (A - B) > 0 else 0
print(ans)

Solution (Python):
i = list(map(int, input().split()))
r = i[2] - (i[0] - i[1])
if r < 0:
    print("0")
else:
    print(r)

Solution (Python):
A,B,C = map(int, input().split())
ans=C-(A-B)
if ans<0:
  ans=0
print(ans)

Solution (Python):
a,b,c = map(int, input().split())
if b+c>a:
    print(b+c-a)
else:
    print(0)

Solution (Python):

a,b,c = map(int, input().split())

ans = c - (a - b)
if ans < 0:
	ans = 0
print(ans)

Solution (Python):
a,b,c = list(map(int, input().split(" ")))

print((b+c)-a if (b + c) > a else 0)

Solution (Python):

a,b,c = map(int, input().split())
ans = c-(a-b)
if ans < 0:
    ans = 0
print(ans)

Solution (Python):

a,b,c = map(int, input().split())
ans = c-(a-b)
if ans < 0:
    ans = 0
print(ans)

Solution (Python):
N = list(map(int, input().split()))
a,b,c = N[0],N[1],N[2]
ans = c-(a-b)
if ans < 0:
    ans = 0
print(ans)

Solution (Python):

import sys, math, fractions, itertools


def solve(A: int, B: int, C: int):
    print(max(C - (A-B), 0))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    C = int(next(tokens))  
    solve(A, B, C)

if __name__ == '__main__':
    main()

Solution (Python):
a, b, c = map(int, raw_input().split())
print max(c - (a-b), 0)

Solution (Python):
a,b,c = map(int,input().split())

print(max(c-(a-b),0))

Solution (Python):
a,b,c=map(int,input().split())
print(max(-a+b+c,0))

Solution (Python):
a, b, c = map(int, input().split())
print(max(0,c-(a-b)))

Solution (Python):
a,b,c=map(int,input().split())




if a-b<c:
    print(c-(a-b))
else:
    print(0)

Solution (Python):
water=input().split()
w1=int(water[0])
w2=int(water[1])
w3=int(water[2])

def main(a,b,c):
    noko=c-min(a-b,c)
    print(str(noko))
main(w1,w2,w3)

Solution (Python):
from sys import stdin
a,b,c = map(int,stdin.readline().rstrip().split())
a_limit = a-b
if c < a_limit:
    print(0)
else:
    print(c-a_limit)

Solution (Python):
inputs = input().split()

contA_amount = int(inputs[0]) - int(inputs[1])
contB_amount = int(inputs[2])

if contA_amount >= contB_amount:
    contB_left = 0

else:
    contB_left = contB_amount - contA_amount

print(contB_left)

Solution (Python):
S = input().split() 



A = S[0]
B = S[1]
C = S[2]

cup1_capacity = int(A)
cup1_containing = int(B)
cup2_containing = int(C)



water_moved_from_cup2_to_cup1 = cup1_capacity - cup1_containing
cup2_remaining = cup2_containing - water_moved_from_cup2_to_cup1

print(max(cup2_remaining, 0))

Solution (Python):
a,b,c = map(int,input().split())
if b+c>a:
    print(c-(a-b))
else:
    print(0)

Solution (Python):
a,b,c = map(int,input().split())  

ans = (b + c) - a
if ans <= 0:
    ans = 0
    
print(ans)

Solution (Python):
a = []
a = input().split()

A = int(a[0])
B = int(a[1])
C = int(a[2])

if (A - B) >= C :
  ans = 0
if (A - B) < C :
  ans = C - (A - B)
  
print(ans)

Solution (Python):
a, b, c = map(int, input().split())
trans = a-b
if c-trans <= 0:
	print(0)
if c-trans > 0:
	print(c-trans)

Solution (Python):
N=list(map(int,input().split()))

print(max(0,(N[2]-(N[0]-N[1]))))

Solution (Python):
A, B, C=map(int, input().split())
ANS=C-(A-B)
if ANS>=0:
  print(C-(A-B))
else:
  print(0)

Solution (Python):
a,b,c=map(int, input().split())
if (a-b)>=c:
  print(0)
else:
  print(c-(a-b))

Solution (Python):
A, B, C = map(int, input().split())

print(max(C-(A-B), 0))

Solution (Python):
a,b,c=map(int,input().split())
print(max(0,c-a+b))

Solution (Python):
A, B, C = map(int, input().split())

print(max(C-(A-B), 0))

Solution (Python):
a = input().split()
A = int(a[0])
B = int(a[1])
C = int(a[2])
if C-(A-B) >= 0:
    print(C-(A-B))
else:
    print(0)

Solution (Python):
A, B, C = map(int, input().split())
ans = 0 if B+C < A else C - (A - B)
print(ans)

Solution (Python):

a, b, c = map(int, input().split())
ans = c-(a-b)
if ans < 0:
    print(0)
else:
    print(ans)

Solution (Python):
A, B, C = list(map(int, input().split()))
r = C - (A - B)
if r > 0:
    print(r)
else:
    print(0)

Solution (Python):
x=input().split()

y=[0]*3

for i in range(3):
  y[i]=int(x[i])

ans=(y[2]-(y[0]-y[1]))

if ans>0:
  print(ans)
  
elif ans<=0:
  print(0)

Solution (Python):
def resolve():
    a, b, c = map(int, input().split(" "))
    print(max(0, c - a + b))
    
    
resolve()

Solution (Python):
a, b, c = map(int, input().split())
print(max(c - a + b, 0))

Solution (Python):
a,b,c = [int(x) for x in input().split()]
i = c - (a - b)
if i < 0:
  print(0)
else :
  print(i)

Solution (Python):

input = input().split()
a = int(input[0])
b = int(input[1])
c = int(input[2])

ans = c - (a - b)

if ans < 0:
    ans = 0

print(ans)

Solution (Python):
A,B,C = map(int,input().split())
if C-A+B >= 0:
  print(C-A+B)
else:
  print("0")

Solution (Python):

a, b, c = map(int, input().split())
d = b + c
if a > d:
  e = 0
else:
  e = c - (a - b)
  
print(e)

Solution (Python):
a,b,c = map(int,input().split(" "))
result = c-a+b if c-a+b>0 else 0
print(result)

Solution (Python):
a,b,c=map(int,input().split())
print(max(0,c-a+b))

Solution (Python):

a, b, c = map(int, input().split())

ans = c - (a - b) 

if ans < 0:
    ans = 0
else:
    ans = c - (a - b) 

print(ans)

Solution (Python):
A, B, C = map(int, input().split())

ans = max(C-A+B, 0)
print(ans)

Solution (Python):
import sys
 
input_str = input().split(" ")
a = int(input_str[0])
b = int(input_str[1])
c = int(input_str[2])
if(c>=(a-b)):
  print(c-a+b)
else:
  print(0)

Solution (Python):
a, b, c = map(int, input().split())
print(max(0, c-(a-b)))

Solution (Python):
a,b,c=map(int,input().split())
if c-(a-b)<=0:
    print(0)
elif  c-(a-b)>0:
    print(c-(a-b))

Solution (Python):
a, b, c = map(int, input().split())
tmp = c - (a-b)
if tmp < 0:
    print(0)
else:
    print(tmp)

Solution (Python):
A,B,C = map(int,input().split())

ans = max(0,C-A+B)

print(ans)

Solution (Python):
a,b,c = map(int,input().split())
print(max(c - a + b,0))

Solution (Python):
a,b,c = list(map(int,input().split()))
print(max(0,c-(a-b)))

Solution (Python):
a , b , c = list(map(int, input().split(' ')))

if a-b > c:
    print(0)
else:
    print(c-(a-b))

Solution (Python):

a,b,c = list(map(int,input().split()))

remain = a-b
if c <= remain:
    print(0)
else:
    print(c - remain)

Solution (Python):
a = list (map(int,input().split()))
b = a[1] + a[2] - a[0]
b = b if b >= 0 else 0
print(b)

Solution (Python):

a,b,c=map(int, input().split())

d = a-b
e = c-d

if e<0:
  print(0)
else :
  print(e)

Solution (Python):



a, b, c = map(int, input().split())
print("{}".format(max(c-(a-b), 0)))

Solution (Python):
a,b,c = map(int, input().split())
if a >= b+c:
    print(0)
elif a < b+c:
    print(c-(a-b))

Solution (Python):
a, b, c = map(int, input().split())
print(max(c-(a-b), 0))

Solution (Python):
from sys import stdin


a,b,c = [int(x) for x in stdin.readline().rstrip().split()]


print(max(c-a+b, 0))

Solution (Python):
num = [int(i) for i in input().split()]

A = num[0]
B = num[1]
C = num[2]
 
temp = C - (A - B)
if temp < 0:
  temp = 0
  
print(temp)

Solution (Python):
get = input().split()
A, B, C = int(get[0]), int(get[1]), int(get[2])
cap = A - B
if cap >= C:
    print(0)
else:
    print(C - cap)

Solution (Python):
A,B,C=map(int,input().split())

ans=0

if A-B<C:
    ans=C-(A-B)

print(ans)

Solution (Python):
N = input().split()

A = int(N[0])
B = int(N[1])
C = int(N[2])

cap = A-B
print(C-min(A-B,C))

Solution (Python):


a, b, c = map(int, input().split())

ans = c - (a - b)
if ans < 0:
    ans = 0

print(ans)

Solution (Python):
N = input().split()

A = int(N[0])
B = int(N[1])
C = int(N[2])

if A<=B:
  print(C)
elif A>B:
  if A-B>C:
    print(0)
  else:
    print(C-(A-B))

Solution (Python):
A, B, C = map(int, input().split())
ans = B + C - A
if ans >= 0:
    print(ans)
else:
    print(0)

Solution (Python):
a, b, c = map(int, input().split())
print(max(0, c-(a-b)))

Solution (Python):
a, b, c = map(int, input().split())

remain = a - b
ans = c - remain

if ans >= 0:
    print(ans)

elif ans < 0:
    print(0)

Solution (Python):
a, b, c = (int(x) for x in input().split())
if c-a+b>0:
	print(c-a+b)
else:
 	print(0)

Solution (Python):
a, b, c = map(int, input().split())
print(max(0, c-a+b))

Solution (Python):
A,B,C = list(map(int,input().split()))
ans = C-(A-B)
if ans>=0:
    print(ans)
else: 
    print(0)

Solution (Python):
A,B,C=list(map(int,input().split()))
ans = C-(A-B)
if ans < 0:
    ans = 0
print(ans)

Solution (Python):
A,B,C=map(int,input().split())
if B+C>A:
	print(B+C-A)
else:
	print("0")

Solution (Python):
A, B, C = map(int, input().split())
if (C - (A - B)) < 0:
    print(0)
else:
    print(C - (A - B))

Solution (Python):
def test():
    a,b,c = map(int,input().split())

    for i in range(a):
        if b == a:
            break
        else:
            b += 1
            c -= 1
            if c == 0:
                break
            else:
                pass

    print(c)


if __name__ == "__main__":
    test()

Solution (Python):
ABC=input().split()
spaceA=int(ABC[0])-int(ABC[1])
lessB=int(ABC[2])-spaceA
if(lessB <0):
	print(0)
else:
	print(lessB)

Solution (Python):
A, B, C = map(int, input().split())
if A>B+C:
    print(0)
else:
    print(B+C-A)

Solution (Python):
[a,b,c] = map(int, input().split(" "))
d = c - (a-b)
d = 0 if d < 0 else d
print(d)

Solution (Python):
A, B, C = map(int, input().split())

if A < B + C:
    print(C-A+B)
else:
    print(0)

Solution (Python):
a,b,c = map(int, input().split())

print(max(c-(a-b),0))

Solution (Python):
point = [int(i) for i in input().split()] 
point[2]-(point[0]-point[1])
a = point[2]-(point[0]-point[1])
if a>0:
    print(a)
else:
    print(0)

Solution (Python):
a,b,c=map(int,input().split())
ans=max(0,c-(a-b))
print(ans)

Solution (Python):
a,b,c=map(int,input().split())
print(0 if c-a+b<=0 else c-a+b)

Solution (Python):
a=input().split(" ")
A=int(a[0])
B=int(a[1])
C=int(a[2])
if C-A+B>=0:
    print(C-A+B)
else:
    print(0)

Solution (Python):
a, b, c = map(int, input().split())
print(max(c-a+b, 0))

Solution (Python):
a, b, c = [int(i) for i in input().split()]

if(a - b < c):
  print(c - a + b)
else:
  print(0)

Solution (Python):
IN = input()
A, B, C = [int(x) for x in IN.split(" ")]
total = 0
try:
    total = C - min((A-B), C)
    print(total)
except:
    print("ERROR")

Solution (Python):
a,b, c = map(int, input().split())
s=c-(a-b)
if s<=0:
  s=0
print(s)

Solution (Python):
A,B,C = map(int,input().split())
res = -A+B+C
if res <= 0:
  res = 0
print(res)

Solution (Python):
inputs = [int(i) for i in str(input()).split()]
cup1_reserve = inputs[0] - inputs[1]
cup2_contain = inputs[2]

if (cup1_reserve >= cup2_contain):
    print(0)
else:
    print(cup2_contain - cup1_reserve)

Solution (Python):
x = input().split(' ')
n = list(map(int, x))
ans = n[2] - (n[0]-n[1])
if ans > 0:
  print(ans)
else:
  print(0)

Solution (Python):
A, B, C = [int(i) for i in input().split(' ')]
print(0 if (C - (A - B)) < 0 else C - (A - B))

Solution (Python):
_abc = [int(i) for i in input().split()]
a = _abc[0]
b = _abc[1]
c = _abc[2]

ans = c-(a-b)
if ans < 0:
  print(0)
else:
  print(ans)

Solution (Python):
a, b, c = map(int, input().split())  
print(max(c-a+b, 0))

Solution (Python):

a, b, c = map(int, input().split())
if c-(a-b) > 0:
    print(c-(a-b))
else:
    print(0)

Solution (Python):
a, b, c = map(int, input().split())
point = a - b
if (point >= c):
    ans = 0
else:
    ans = c - point
print(ans)

Solution (Python):

A,B,C = map( int, input().split())
x = A - B
left = C - (A - B) 
if left <= 0:
    left = 0
print( left )

Solution (Python):
a,b,c=map(int,input().split())
print(c-(a-b) if c-(a-b)>0 else 0)

Solution (Python):
a_b_c = input()
a, b, c = a_b_c.split(' ')
a, b, c = int(a), int(b), int(c)

print(max(c - (a - b), 0))

Solution (Python):
a,b,c=map(int,input().split())
if b+c-a<0:
        print(0)
else:
        print(b+c-a)

Solution (Python):
A, B, C = map(int, input().split())
if A >= B + C:
    print(0)
else:
    print(C - A + B)

Solution (Python):
A, B, C = [int(_) for _ in input().split()]

print(max(C - (A - B), 0))

Solution (Python):
A, B, C = [int(m) for m in input().split(' ')]
result = A - B - C

if result < 0:
	print(abs(result))
else:
	print(0)

Solution (Python):
a,b,c = list(map(int,input().split(" ")))
print(max(0, c -a+b))

Solution (Python):
A, B, C = map(int, input().split())
if A-B >= C:
    print(0)
else:
    print(C - (A - B))

Solution (Python):
A, B, C = map(int, input().split())

if (A - B) >= C:
    print(0)
else:
    print(C - (A-B))

Solution (Python):
A, B, C = map(int, input().split())

D=A-B
E=C-D

if E<=0:
    print(0)
else:
    print(E)

Solution (Python):
a, b ,c = map(int,input().split())

remain = a- b
ans = c - remain
if ans <= 0:
    ans = 0
print(ans)

Solution (Python):
A,B,C = [int(n) for n in input().split()]
print(C-(A-B) if C-(A-B)>0 else 0)

Solution (Python):
x,y,z=map(int,input().split())

print(0 if z-(x-y)<0 else z-x+y)

Solution (Python):
input_num=input().split()
input_num=[int(num) for num in input_num]

A,B,C=input_num

cup_1=B
cup_2=C

cup_1=B+cup_2
cup_2=0

if cup_1>=A:
    cup_1=A
    cup_2=B+C-cup_1
    print(cup_2)
else:
    print(0)

Solution (Python):
fulla, a, b = (int(i) for i in input().split())
k = b - (fulla - a)
if k < 0:
  print(0)
else:
  print(k)

Solution (Python):
A, B, C =map(int,input().split())
if C > A-B:
    print(C - (A-B))
else:
    print(0)

Solution (Python):
A, B, C = map(int,input().split())
if B+C < A:
    print(0)
else:
    ans = C - (A - B)
    print (ans)

Solution (Python):
a,b,c = map(int,input().split())
if c-(a-b) < 0:
    print("0")
else: 
    print("{}".format(c-(a-b)))

Solution (Python):
a, b, c=map(int,input().split())
x = min(a-b,c)
print(c-x)

Solution (Python):
A, B, C = list(map(int, input().split()))

n = A - B
if n >= C:
    print(0)
else:
    print(C - n)

Solution (Python):

"""
Created on Fri Aug  9 21:15:19 2019

@author: Yamazaki Kenichi
"""

A,B,C = map(int,input().split())

ans = B + C - A
if ans < 0:
    print(0)
else:
    print(ans)

Solution (Python):
A,B,C=map(int,input().split())
x=min(A-B,C)
print(C-x)

Solution (Python):
a, b, c = map(int, input().split())
d = c - (a - b) 

if d>= 0:
  print(d)
else:
  print(0)

Solution (Python):
A,B,C=map(int,input().split())
if C-A+B<=0:
    print(0)
else: print(C-A+B)

Solution (Python):
a,b,c=map(int,input().split())
print(c-min(a-b,c))

Solution (Python):
x = list(map(int, input().split()))
x[0] = -1*x[0]
print(max(sum(x), 0))

Solution (Python):
A,B,C = map(int,input().split())
print(max(0, (B + C) - A))

Solution (Python):
i = list(map(int, input().split()))

if i[2] >= i[0]-i[1]:
  print(i[2]-i[0]+i[1])
else:
  print(0)

Solution (Python):
a,b,c=map(int,input().split())
d=a-b
if d>=c:
    print(0)
else:
    e=c-d
    print(e)

Solution (Python):
A,B,C = map(int, input().split())

capa = A - B
ans = C - capa

if ans > 0:
    print(ans)
elif ans <= 0:
    print(0)

Solution (Python):
a, b, c = map(int, input().split())
rest = c - (a - b)
if rest < 0:
  rest = 0
print(rest)

Solution (Python):
a, b, c = list(map(int, input().split()))
ans=c-(a-b)

if ans>0:
  print(ans)
else:
  print(0)

Solution (Python):
A, B, C = map(int, input().split())

C = C - (A - B)
if C < 0:
    C = 0
print(C)

Solution (Python):
input = input().split()
A = int(input[0])
B = int(input[1])
C = int(input[2])
 
X = C - (A - B)
if X < 0: X = 0
print(X)

Solution (Python):
A, B, C = map(int, input().split())
ans = C - (A - B)
if ans < 0:
  ans = 0
print(ans)

Solution (Python):
a,b,c = map(int, input().split())
 
if b+c > a :
  print(c-(a-b))
  
else:
  print(0)

Solution (Python):
a,b,c = map(int, input().split())
ans = c-(a-b)

if ans < 0:
  print(0)
else:
  print(ans)

Solution (Python):
A,B,C=map(int,input().split())
D=C-A+B
if D>0:
    print(D)
else:
   print(0)

Solution (Python):
A, B, C = map(int, input().split())

if A-B>=C:
    print(0)
else:
    print(C-(A-B))

Solution (Python):
a, b, c = map(int, input().split())
res = c - (a - b) if c - (a - b) > 0 else 0
print(res)

Solution (Python):
[a,b,c] = [int(i) for i in input().split()]
print(c-min(c,a-b))

Solution (Python):
a, b, c = map(int, input().split())
if c - (a - b) < 0:
  print("0")
  exit()
print(c - (a - b))

Solution (Python):
a, b, c = map(int, input().split())

answer = c - (a - b)
print(answer if answer > 0 else 0)

Solution (Python):
a,b,c = list(map(int,input().split()))

if(a-b >= c):
    print(0)
else:
    print(c-(a-b))

Solution (Python):
A, B, C = [int(x) for x in input().split()]

ans = max(C - (A - B), 0)

print(ans)

Solution (Python):
a,b,c = map(int,input().split())
ans = b + c - a
print(0 if ans<=0 else ans)

Solution (Python):
a, b, c = map(int, input().split())

if b + c >= a:
    print(c - (a-b))
else:
    print(0)

Solution (Python):
a, b, c = map(int, input().split())

print(max(b+c-a,0))

Solution (Python):
a,b,c = map(int, input().split())
ans = c-(a-b)
if ans >= 0:
    print(ans)
else:
    print(0)

Solution (Python):

N = input()

A = int(N.split()[0])
B = int(N.split()[1])
C = int(N.split()[2]) 

D = A-B

if D<C:
    print(C-D)

else:
    print(0)

Solution (Python):
A, B, C = map(int, input().split())

result = C - (A - B)
if result > 0:
  print(result)
else:
  print(0)

Solution (Python):
a, b, c = map(int, input().split())
mizu = c-(a-b)
if mizu  >=0:
  print(mizu)
else:
  print(0)

Solution (Python):
a,b,c = map(int, input().split())
print(b+c-a if b+c-a > 0 else 0)

Solution (Python):
a,b,c = map(int,input().split());
if((a-b)<c):
  print(c-(a-b))
else:
  print(0)

Solution (Python):
A,B,C = map(int,input().split())
D = B+C-A
if D > 0:
    print(D)
else:
    print(0)

Solution (Python):
A, B ,C = input().split()
ans = int(C)-(int(A)-int(B))
if ans < 0:
    print(0)
else:
    print(ans)

Solution (Python):
x,y,z = map(int,input().split())

a=x-y
b=z-a

if(b<0):
    b=0
 
print(b)

Solution (Python):
num = input().split()
A = int(num[0])
B = int(num[1])
C = int(num[2])
if A-B<C:
    print(C-A+B)
else:
    print(0)

Solution (Python):
a,b,c = [int(x) for x in input().split()]
n = c-(a-b)
print(n if n > 0 else 0)

Solution (Python):
a, b, c = map(int, input().split())
print(max(0, c-(a-b)))

Solution (Python):
A, B, C = map(int, input().split())
print((B + C - A) if (B + C) > A else 0)

Solution (Python):

a, b, c = map(int, input().split())


print("{}".format(c-(a-b) if (c-(a-b)) > 0 else 0))

Solution (Python):
A, B, C = map(int, input().split())
D = C - A + B
if D >= 0:
    print(D)
else:
    print(0)

Solution (Python):
a,b,c = [int(x) for x in input().split()]
if c-(a-b)<0:
    ans = 0
else:
    ans = c-(a-b)
print(ans)

Solution (Python):
lst = input().split()
a = int(lst[0])
b = int(lst[1])
c = int(lst[2])
print(max(0,c-(a-b)))

Solution (Python):
a,b,c = map(int,input().split())
print (max(0,c-(a-b)))

Solution (Python):
a, b, c = map(int, input().split())
print(max(0,c-(a-b)))

Solution (Python):
A,B,C=map(int,input().split())
if (A-B) >= C:
    print(0)
else:
    print(C-A+B)

Solution (Python):
S = input().split()

A = int(S[0])
B = int(S[1])
C = int(S[2])

res = A - B - C

print(0 if res >= 0 else abs(res))

Solution (Python):
a,b,c = map(int,input().split())
print(c-min(a-b,c))

Solution (Python):
A, B, C = map(int, input().split())
if C - (A - B) >= 0:
    print(C - (A - B))
else:
    print(0)

Solution (Python):

 
a, b, c = map(int, input().split())
rest = a - b
if c - rest < 0:
  print(0)
else:
  print (c - a + b)

Solution (Python):
a,b,c= [int(x) for x in raw_input().split()]
pr=max0=c -min(int(x),a-b)
print max0

Solution (Python):
input_line = input().split()

youki1 = int(input_line[0]) - int(input_line[1])

youki2 = int(input_line[2]) - youki1

if youki2 <= 0:
    print(0)
else:
    print(youki2)

Solution (Python):
a,b,c = map(int, input().split())

if b+c < a:
    print('0')
else:
    print(b+c-a)

Solution (Python):
a,b,c = map(int,input().split())
print(max(b+c-a , 0))

Solution (Python):
Water=input()
Water2=Water.split(" ")

A=int(Water2[0])
B=int(Water2[1])
C=int(Water2[2])

while B<A:
    B=B+1
    C=C-1
    if C==0:
        break

print(C)

Solution (Python):
Water=input()
Water2=Water.split(" ")

A=int(Water2[0])
B=int(Water2[1])
C=int(Water2[2])

while B<A:
    B=B+1
    C=C-1
    if C==0:
        break

print(C)

Solution (Python):
A,B,C=map(int,input().split())
num1=A-B
def f(C,num1):
  if  C>=num1:
    return C-num1
  else:
    return 0
rest=f(C,num1)
print(rest)

Solution (Python):
A,B,C = map(int, input().split())
if C-(A-B) > 0:
    print(C-(A-B))
else:
    print(0)

Solution (Python):
temp=list(map(int, input().split()))
a=temp[2]-(temp[0]-temp[1])
if a>=0:
  print(a)
else:
  print(0)

Solution (Python):
a,b,c=map(int,input().split())
print(max(0, b+c-a))

Solution (Python):
A, B, C = map(int,  input().split())
ans = 0 if C-(A-B) < 0 else C-(A-B)
print(ans)

Solution (Python):
a,b,c=map(int,input().split())
d=a-b
e=c-d
if e>=0:
  print(e)
else:
  print(0)

Solution (Python):
a,b,c=map(int,input().split())
ans=b+c-a
if ans<0:
  ans=0
print(ans)

Solution (Python):
A, B, C = map(int, input().split())
if A - B >= C:
  r = 0
else:
  r = C - (A - B)
print(r)

Solution (Python):
a, b, c = list(map(int, input().split()))
print(max(c - (a-b), 0))

Solution (Python):
a,b,c=map(int,input().split())
print(max(0,c-a+b))

Solution (Python):
a,b,c=map(int,input().split())
print(max(0, c-a+b))

Solution (Python):
n = input().split()
a = int(n.pop(0))
b = int(n.pop(0))
c = int(n.pop(0))

if (a-b > c):
    print(0)
else:
    print(c-a+b)

Solution (Python):
A, B, C = map(int, input().split())
if (A - B) >= C:
    print(0)
else:
    print(C - (A - B))

Solution (Python):
a,b,c = map(int,input().split())
x = c-(a-b)

if x > 0:
	print(x)
else:
	print(0)

Solution (Python):
a,b,c = map(int, input().split())

print(max(0, c-a+b))

Solution (Python):
a,b,c = map(int, input().split())

print(max(0, c-a+b))

Solution (Python):
A, B, C = map(int, input().split())

print(C - (A - B) if C > (A - B) else 0)

Solution (Python):
a, b, c = map(int, input().split())
if c <= a - b:
    ans = 0
else:
    ans = c - a + b
print(ans)

Solution (Python):
A, B, C = (int(i) for i in input().split(" "))
 
D = A - B

 
if C - D <= 0:
  print(0)
else:
  print(C-D)

Solution (Python):
a, b, c = map(int, input().split())
d = (c-(a-b))
if d > 0:
    print(d)
else:
    print("0")

Solution (Python):
a, b, c = map(int, input().split(" "))
if a >=b+c:
    print(0)
else:
    print(abs(a-b-c))

Solution (Python):
A,B,C = map(int, input().split())
result = C-A+B
if result < 0:
  print(0)
else:
  print(result)

Solution (Python):




def main():
    
    a, b, c = map(int, input().split())
    print(process(a, b, c))


def process(a, b, c):
    ans = c - (a - b)
    if ans < 0:
        ans = 0
    return ans


if __name__ == "__main__":
    main()

Solution (Python):


A,B,C=(int(x) for x in input().split())
i=0

if 1<=B<=A<=20 and 1<=C<=20:
    i=C-(A-B)
    if i<0:
        i=0
else:
    print('condition failed')

print(i)

Solution (Python):


inputs = input().split()
A = int(inputs[0])
B = int(inputs[1])
C = int(inputs[2])

capa = A - B
if capa >= C:
    print(0)
else:
    print(C-capa)

Solution (Python):
A,B,C=map(int,input().split())
if C-A+B>0:
    print(C-A+B)
else:
    print(0)

Solution (Python):
a, b, c = map(int, input().split())
print(max(c-a+b,0))

Solution (Python):
A, B, C = map(int, raw_input().split())
vacancy = A-B
if C > vacancy:
    print str(C-vacancy)
else:
    print "0"

Solution (Python):
a,b,c=map(int,input().split())
if a-b>=c:print(0)
else:print(c-a+b)

Solution (Python):
a,b,c = map(int,input().split())
if a>=b+c:print(0)
else:print((b+c)-a)

Solution (Python):
a,b,c = map(int,input().split())
if a>=b+c:print(0)
else:print((b+c)-a)

Solution (Python):
a, b, c = map(int, input().split())
print(max(c - a + b, 0))

Solution (Python):
a, b, c = map(int,input().split())
x = a - b
if c <= x:
	print(0)
else:
	y = c - x
	print(y)

Solution (Python):
a, b, c = input().split()
x = int(a) - int(b)
if int(c) <= x:
	print(0)
else:
	y = int(c) - x
	print(y)

Solution (Python):


a, b, c = map(int, input().split())
d = c + b - a

if d < 0 :
   d = 0

print(d)

Solution (Python):
a,b,c =map(int,input().split())
ans = c-(a-b)
print(ans if ans > 0 else 0)

Solution (Python):
a,b,c = list(map(int, input().split(' ')))
if a-b <= c:
    print(c-a+b)
else:
    print(0)

Solution (Python):

a,b,c = map(int, input().split())

if a > (b + c):print(0)
else:
	print((b + c) - a)

Solution (Python):
A, B, C = map(int, input().split())
print(max( C - (A - B), 0))

Solution (Python):
A,B,C = map(int,input().split())
if C-(A-B)>0:
  print(C-(A-B))
else:
  print("0")

Solution (Python):
line = list(map(int, input().split()))

ans = 0
if line[0] - line[1] >= line[2]:
  print(ans)
else:
  ans = line[2] - (line[0] - line[1])
  print(ans)

Solution (Python):
input_data=input().split()
A=int(input_data[0])
B=int(input_data[1])
C=int(input_data[2])
x=C-(A-B)

if x>=0:
    output=x
else:
    output=0

print(output)

Solution (Python):
A, B, C = map(int, input().split())
print(max(0, C - (A - B)))

Solution (Python):
print(*[ 0 if y[1]+y[2]<y[0]+1 else y[1]+y[2]-y[0] for y in [[int(x) for x in input().split()]]])

Solution (Python):
import numpy as np

a,b,c=map(int,input().split())
print(np.where(c-a+b>0,c-a+b,0))

Solution (Python):
a,b,c=map(int,input().split())

x=0
if c-(a-b)>0:
  x=c-(a-b)

print(x)

Solution (Python):
a,b,c=map(int,input().split())
if a-b>=c:
  print(0)
else:
  print(c-(a-b))

Solution (Python):
def solve(string):
    a, b, c = map(int, string.split())
    return str(max(c - a + b, 0))


if __name__ == '__main__':
    print(solve(input()))

Solution (Python):
A = list(map(int, input().split()))
print(max(0,A[2]-(A[0]-A[1])))

Solution (Python):
def main():
    a,b,c = map(int,input().split())
    print(max(c-(a-b),0))








main()

Solution (Python):
A,B,C = map(int, input().split())
D=C-(A-B)
if D > 0:
    print(D)
else:
    print(0)

Solution (Python):
a, b, c = map(int, input().split())
if a > b + c:
    print(0)
else:
    print(b+c-a)

Solution (Python):

A, B, C = map(int, input().split())

result = C - A + B
if result < 0:
    result = 0
    
print(result)

Solution (Python):
A, B, C = map(int, input().split())
print(max(0, C-(A-B)))

Solution (Python):


a,b,c=map(int,raw_input().split())
if a-b>=c:
 print 0
else:
 print c-(a-b)

Solution (Python):
a, b, c = map(int, input().split())
print(max(c-a+b,0))

Solution (Python):
A, B, C = map(int, input().split())
print(C - min(A - B, C))

Solution (Python):
a, b, c = [int(x) for x in input().split(' ')]

result = max(c - a + b, 0)
print(result)

Solution (Python):
[a, b, c] = map(int, input().split())

print(max([c - (a - b), 0]))

Solution (Python):
A,B,C = map(int,input().split())
delta = A-B
ans = C - delta
if ans <=0:
    ans = 0
print(ans)

Solution (Python):
a,b,c=map(int,input().split())
k=b+c
if k<=a:
  print("0")
else:
  print(k-a)

Solution (Python):
a, b, c = map(int, input().split())
print(max(0, c - (a-b)))

Solution (Python):
a, b, c = map(int, input().split(" "))
print(max(0, c - (a - b)))

Solution (Python):
A,B,C = map(int,input().split())
ans=C-(A-B)
if ans<0:
  print(0)
else:
  print(ans)

Solution (Python):
A,B,C=input().split()
A=int(A)
B=int(B)
C=int(C)
ans=C-(A-B)
if ans<0:
  ans=0
print(ans)

Solution (Python):
a,b,c = map(int, input().split())
if a < b + c: print(c-a+b)
else: print("0")

Solution (Python):
vals = [int(x) for x in input(). split()]
dif = vals[0] - vals[1]
 
if dif >= vals[2]:
  print(0)
else:
  print(vals[2] - dif)

Solution (Python):
A,B,C=map(int,input().split())
rest=C-A+B
if rest>0:
  print(rest)
else:
  print(0)

Solution (Python):
A,B,C=map(int,input().split())
if  C - (A - B) > 0:
  print(C - (A - B))
else:
  print(0)

Solution (Python):
a,b,c = map(int, input().split())
w = (b+c)-a
if w < 1:
    w = 0
print (w)

Solution (Python):
a,b,c = map(int, input().split())
w = (b+c)-a
if w < 1:
    w = 0
print (w)

Solution (Python):
vals = [int(x) for x in input(). split()]
dif = vals[0] - vals[1]
 
if dif >= vals[2]:
  print(0)
else:
  print(vals[2] - dif)

Solution (Python):
A,B,C = (int(x) for x in input(). split())

if(A-B>C):
  ans=0
else:
  ans=B+C-A
print(ans)

Solution (Python):
A,B,C = map(int,input().split())
print(max(0,B+C-A))

Solution (Python):
a, b, c = (int(x) for x in input(). split())
d = c-(a-b)
if d <= 0 :
    print(0)
else :
    print(d)

Solution (Python):
A, B, C = map(int,input().split())
if B+C-A < 0:
    print('0')
else:
    print(B+C-A)

Solution (Python):
a,b,c = map(int,input().split())
print(max(0,c-(a-b)))

Solution (Python):
a=input().split()
for i in range(3):
    a[i]=int(a[i])

b=a[2]-a[0]+a[1]
if b>0:
    print(int(b))
else:
    print(0)

Solution (Python):
a,b,c = map(int,input().split(" "))
if (b + c) <= a:
  print(0)
else:
  print((b + c) - a)

Solution (Python):
a,b,c = map(int, input().split())
r = c-(a-b)
print(0) if r <= 0 else print(r)

Solution (Python):


def solve():
    A,B,C = list(map(int, input().split()))
    print(max(C-(A-B), 0))

if __name__ == "__main__":
    solve()

Solution (Python):
a, b, c = map(int, input().split())
print(max(c - (a - b), 0))

Solution (Python):
from math import floor
A, B, C = map(int, input().split())
print(C-(A-B) if C-(A-B)>=0 else 0)

Solution (Python):
A,B,C = map(int,input().split())
if C-(A-B)>0:print (C-(A-B))
else: print (0)

Solution (Python):
A, B, C = [int(i) for i in input().split()]

ans = C - (A - B)
if ans < 0:
    ans = 0
    
print(ans)

Solution (Python):
A,B,C = map(int, input().split())
print(C-min(A-B, C))

Solution (Python):
a,b,c = map(int, input().split())
nokori = c + b - a
if nokori > 0:
    print(nokori)
else:
    print(0)

Solution (Python):
A,B,C = map(int,input().split())
print(max(0,C-(A-B)))

Solution (Python):
a, b, c = map(int, input().split())

diff = a - b - c

if diff >= 0:
  print(0)
else:
  print(-diff)

Solution (Python):
abc = input()
a = int(abc.split(' ')[0])
b = int(abc.split(' ')[1])
c = int(abc.split(' ')[2])
if (c-(a-b))>0:
    print(c-(a-b))
else:
    print(0)