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):
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())

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

Solution (Python):
a,b,c = map(int,input().split())
d = a-b
if c - d >= 0:
  print(c-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())
if a-b >= c:
  ans=0
else:
  ans=c-(a-b)
print(ans)

Solution (Python):

import sys


def solve(A: int, B: int, C: int):
    print(max(0, C-(A-B)))
    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,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=[int(s) for s in input().split()]
print(max(0,c-(a-b)))

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

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

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 = map(int, input().split())
ans = C - (A - B)
if ans < 0:
    ans = 0
print(ans)

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)>=0 else 0)

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

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

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())

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=[int(i) for i in 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())

spac = a - b
ans  = c - spac

if 0 > ans:
  ans = 0

print(ans)

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=input().split()

if int(C)-(int(A)-int(B))>=0:
  print(int(C)-(int(A)-int(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,b,c= map(int, input().split())

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

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())
spareA = a-b
ans = c - spareA
ans = ans if ans >= 0 else 0
print(ans)

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, B, C = map(int, input().split())
print(max(C-(A-B), 0))

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

ans = t if t > 0 else 0
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())
ans = c - (a - b)
print(ans if ans >= 0 else 0)

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

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

if __name__ == '__main__':
  main()

Solution (Python):
list_ = input().split()
remain_quant = int(list_[0]) - int(list_[1])
if remain_quant >= int(list_[2]):
  print(0)
else:
  print(int(list_[2]) - remain_quant)

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

Solution (Python):
import sys
from collections import deque
sys.setrecursionlimit(20000000)
input = sys.stdin.readline


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

    rest = a - b
    if rest < 0:
        rest = 0

    if rest > c:
        print(0)
    else:
        print(c - rest)


if __name__ == '__main__':
    main()

Solution (Python):


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

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

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

Solution (Python):
list_ = input().split()
remain_quant = int(list_[0]) - int(list_[1])
if remain_quant >= int(list_[2]):
  print(0)
else:
  print(int(list_[2]) - remain_quant)

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

print(max(0,c + b - 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:
    ans = 0
print(ans)

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

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

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())
print(max(c-(a-b),0))

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

if d<=0:
  print('0')
else:
  print(d)

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

if diff >0:
    ans = C - diff

print(max(ans, 0))

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

aki = a - b

if aki >= c:
    print(0)
else:
    print(c-aki)

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




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

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(0, C-(A-B)))

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

accept = A - B
if C - accept > 0:
    print(C-accept)
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())
if A-B>C:
  print(0)
else:
  print(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(0 if A>=B+C else -A+B+C)

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

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

Solution (Python):
a,b,c=map(int,input().split())
if b+c>a:
    print(b+c-a)
elif b+c<=a:
    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(b+c-a if b+c>a else 0)

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

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

container_A = int(A) - int(B)
container_C = min(container_A, int(C))

ans = int(C) - container_C

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())
d = a - b
e = c -d
if e > 0:
  print(e)
else:
  print(0)

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

print(ans if c-(a-b) > 0 else 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 = list(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())		
x = C-(A-B)
if x < 0:
	x = 0
print(x)

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):
A,B,C = map(int,(input().split()))
if A-B==0:
    print(C)
else:
    ans = C-A+B
    print(ans if ans>=0 else 0)

Solution (Python):
a,b,c=map(int,input().split())
print(0 if a-b>=c else 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())
print(b + c -a if b + c-a >= 0 else 0)

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

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

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(ans)
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("0") if C - (A - B) < 0 else print(C - (A - B))

Solution (Python):
a, b, c = map(int, input().split())
if 1 <= b <= a <= 20 and 1 <= c <= 20:
    if b + c <= a:
        print(0)
    else:
        print(b + c - a)
else:
    print('invalid value.')

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(A-B>=C):
  print("0")
else:
  print(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):
def solve():
    leftCapacity, leftContent, rightContent = map(int, input().split())
    leftRemain = leftCapacity - leftContent

    if leftRemain >= rightContent:
        print(0)
    else:
        print(rightContent - leftRemain)
solve()

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

Solution (Python):
import sys
input = sys.stdin.readline

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

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

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

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

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

print(remaining)

Solution (Python):
A,B,C = [int(s) for s in input().split(" ")]
print(max(0,C - (A-B)))

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

Solution (Python):
def getlist():
	return list(map(int, input().split()))

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

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())
ans = c-(a-b)
if ans < 0:
    ans = 0
print(ans)

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

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

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

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


if __name__ == '__main__':
    main()

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

x = a[2] - (a[0] - a[1])

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

Solution (Python):
a, b, c = map(int, input().split())
result = max(c - (a - b), 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())

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

Solution (Python):
if __name__ == '__main__':
	A,B,C = map(int, input().split())	
	if (A - B - C ) >= 0:
		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())

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

print(remain)

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

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

temp=temp[2]-(temp[0]-temp[1])

if temp<0:
  print(0)
else:
  print(int(temp))

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())

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

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

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=A-B
e=max(0,C-d)
print (e)

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

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 = map(int, input().split())
ans=b+c-a
if(ans>0):
    print(ans)
else:
    print(0)

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

a=(matchNums[0]-matchNums[1])
if a>matchNums[2]:
    print(0)
else:
    print(matchNums[2]-a)

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline

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

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

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

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(0, c-a+b))

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

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

Solution (Python):
A, B, C = map(int, input().split())
print(max(C - (A - min(A, B)), 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())
need = a - b
put = min(c, (a-b))
print(c - put)

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(0, (c - (a - b))))

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

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

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

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

Solution (Python):


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

new1 = min(B+C,A)
new2 = C - min(B+C,A) + B

print(new2)

Solution (Python):
import sys

for line in sys.stdin:
    A, B, C = map(int, line.split())


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

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

Solution (Python):
_list = input().split()
a, b, c = int(_list[0]), int(_list[1]), int(_list[2])
 
result = c - (a -b)
if result < 0:
    print(0)
else:
    print(result)

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())
print(max(c+b-a,0))

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


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

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

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

Solution (Python):
A,B,C=map(int,input().split())
can=(A-B)
if (C-can)>0:
    print(C-can)
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())
con1 = a - b
con2 = c

if con1 >= con2:
  print(0)
else:
  print(con2 - con1)

Solution (Python):

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

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

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

Solution (Python):
A,B,C = [int(v) for v in input().split()]
print(max(C-(A-B),0))

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

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

print(max(-(A - B - C), 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(0,c-a+b))

Solution (Python):

number = list(map(int,input().split()))
if (number[0]-number[1])<number[2]:
    print(number[2]-number[0]+number[1])
else:
    print(0)

Solution (Python):
import numpy as np

s = input().split()
a=int(s[0])
b = int(s[1])
c = int(s[2])
x=c-a+b
if x<0:
        x=0
print(x)

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

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

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

ans = max(c-(a-b), 0)

print("{}".format(ans))

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

Solution (Python):
a,b,c=list(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())
ans = C-(A-B)
if ans > 0:
  print(ans)
else:
  print(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())

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

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

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

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())

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

Solution (Python):
def main_func():
    
    cap1, init_vol, cap2  = map(int, input().split())
    if cap1 > init_vol + cap2:
        print(0)
    else:
        print(init_vol + cap2 - cap1)
        
main_func()

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

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

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

ans1 = a - b
ans2 = c - ans1

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

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

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

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

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

ans = c - (a - b)
ans = max(ans, 0)

print(ans)

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

diff = water[0]-water[1]
result = water[2]-diff
if result>=0:
  print(result)
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(c-(a-b))
else:
    print(0)

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

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

Solution (Python):
import sys

A, B, C = list(map(int, sys.stdin.read().strip().split(" ")))
print(max(0, C - (A - B)))

Solution (Python):

import sys


def solve(A: int, B: int, C: int):
    empty = A - B
    C -= empty
    if C < 0:
        C = 0
    print(C)
    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, 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)
if A<=B+C:
    print(B+C-A)

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())

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

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

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

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(C-(A-B), 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())

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

Solution (Python):

import bisect
import collections
import itertools


def getint(): return int(input())
def getints(): return list(map(int, input().split()))
def getint2d(rows): return [getints() for _ in range(rows)]
def getgrid(rows): return [input() for _ in range(rows)]
def array1d(n, value): return [value for _ in range(n)]
def array2d(n, m, value): return [array1d(m, value) for _ in range(n)]

a,b,c=getints()
move = min(a-b,c)
print(c-move)

Solution (Python):


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

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

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

water = c - (a - b)

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

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())
print(max(C - (A - B), 0))

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

Solution (Python):
while True:
    try:
        a,b,c = map(int,input().strip().split())
        print(max(b + c - a,0))
    except:
        break

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,b,c = list(map(int,input().split()))

result = c - (a - b)

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline

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

d = C - (A - B)

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

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

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

Solution (Python):
a,b,c=list(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())
if a<b+c:
    print(b+c-a)
else:
    print(0)

Solution (Python):
def A_Transfer():
    A, B, C = map(int, input().split())
    ans = max(0, C-A+B)
    print(ans)
    
if __name__ == "__main__":
    A_Transfer()

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())

aa = C - (A - B)

if aa > 0:
  print(aa)
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())

X = C - (A - B)

if X < 0:
	X = 0

print(X)

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

Solution (Python):
import sys
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())
rest = C - (A - B)
result = (rest if rest >= 0 else 0)
print(result)

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

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 = 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())
if C-(A-B) >= 0:
         print(C-(A-B))
else:
         print(0)

Solution (Python):
a, b, c = 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())
ret = max(0, C - (A - B))
print(ret)

Solution (Python):
from sys import stdin
a, b, c = [int(x) for x in stdin.readline().rstrip().split()]

l = c - (a - b)

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

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

Solution (Python):
a,b,c = [int(i) for i 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:
    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()))

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

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

Solution (Python):
A = [int(x) for x in input().split()]
a = A[0]
b = A[1]
c = A[2]
zan = 0
if a >= b:
  zan = a - b
res = c - zan
if res <= 0:
  res = 0
print(res)

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

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

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()))
print(max(C-A+B, 0))

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

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

Solution (Python):

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

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

Solution (Python):

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

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

Solution (Python):




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

to_A = A-B 

result = 0

if to_A < C:
    result = C - to_A
else :
    result = 0

print(result)

Solution (Python):

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

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

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

if 1 <= b <= a <= 20:
    if 1 <= c <= 20:
        x=c-(a-b)

if x<0:
    x=0

print(x)

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

if 1 <= b <= a <= 20:
    if 1 <= c <= 20:
        x=c-(a-b)

if x<0:
    x=0

print(x)

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

re = a - b

res = c - re
if res <= 0:
  print(0)
else:
  print(res)

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

Solution (Python):
x=input().split()
A=int(x[0])
B=int(x[1])
C=int(x[2])
if B+C-A>0:
    print(B+C-A)
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()))
d = b+c-a
if d < 0:
  print(0)
else:
  print(d)

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(x) for x in input().split())

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

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

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-(a-b) if a < b + c else '0')

Solution (Python):


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

Solution (Python):

"""
Created on Mon Aug 12 18:39:30 2019

@author: doppe
"""

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

x = C - (A - B) if C - (A - B) >= 0 else 0

print(x)

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 = list(map(int, input().split()))
if a > b+c:
    print(0)
else:
    print(b+c-a)

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

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

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

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

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

Solution (Python):
import io
import sys

MOD = 10 ** 9 + 7


def IN_S():
  return input()


def IN_I():
  return int(input())


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


def IN_L_S():
  return list(map(str, input().split()))


def STR_SPLIT(s, n):
  for l in range(0, len(s), n):
    yield s[0 + l:n + l]


def T_IN():
  global test_str
  sys.stdin = io.StringIO(test_str[1:-1])


test_str = '''
12 3 7
'''


def MAIN():
  
  A()


def A():
  a, b, c = IN_L_I()
  w = c - (a - b)
  if w < 0:
    w = 0

  print(w)

  return None


def B():
  return None


def C():
  return None


MAIN()

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()))
ret = C - (A - B)
if ret < 0:
  ret = 0
print(ret)

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

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