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

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

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

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

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

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

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

Solution (Python):
A,B,C=(int(x) for x in input().split())
answer = C-(A-B)
if answer<0:
  answer=0
print(int(answer))

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

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

Solution (Python):
def main():

    i = list(map(int, input().split()))
    a = i[0]
    b = i[1]
    c = i[2]

    if  not (1 <= b and b <= a and a <= 20 and 1 <= c and c <= 20):      
        return

    if c >= a - b:
        k = c - a + b
    else:
        k = 0

    print(k)


if __name__ == "__main__":
    main()

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)
    a, b, c = map(int, input().split())
    print(c-min(a-b, c))
 
 
if __name__ == '__main__':
    main()

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)
    a, b, c = map(int, input().split())
    print(c-min(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())
left = c - (a-b)

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

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

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:
  print(x)
else:
  print(0)

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

x = a - b
y = c - x

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

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

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

d = min((A - B), C)
result = C - d

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

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

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

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

Solution (Python):

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

Solution (Python):


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

remain = C - (A - B)

print(remain) if remain > 0 else print(0)

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



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

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



ans = 0

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

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

Solution (Python):

import sys










def main():
    a, b, c = [int(x) for x in sys.stdin.readline().split()]
    if a - b >= c:
        ans = 0
    else:
        ans = c - (a - b)
    print(ans)


if __name__ == "__main__":
    main()

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

a = abc[0]
b = abc[1]
c = abc[2]

ans = c - (a-b)

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

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

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

Solution (Python):
A=list(map(int,input().split()))
if A[2]-(A[0]-A[1])>=0:
    print(A[2]-(A[0]-A[1]))
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,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)

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

Solution (Python):
from collections import defaultdict,deque, Counter
import sys,heapq,bisect,math,itertools,string,queue,copy,time
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

[A,B,C] = inpl()
print(max(B+C-A,0))

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

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

print( ans )

Solution (Python):

import sys
def input():
    return sys.stdin.readline().rstrip()

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

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


if __name__ == '__main__':
    main()

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

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

mL = C - A + B 

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

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

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

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b



def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2



def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)



def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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


if __name__ == '__main__':
    main()

Solution (Python):
import sys
input = sys.stdin.readline
def print_ans(A, B, C):
    """Test Case
    >>> print_ans(6, 4, 3)
    1
    >>> print_ans(8, 3, 9)
    4
    >>> print_ans(12, 3, 7)
    0
    """
    print(max(0,C - A + B))

if __name__ == '__main__':
    A, B, C = map(int,input().rstrip().split())
    print_ans(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):
i = list(map(int, input().split()))
n = i[2] - (i[0] - i[1])
if n > 0:
    print(n)
else:
    print(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())
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()))
if A - B >= C:
  print(0)
else:
  D = C - (A - B)
  print(D)

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

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

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

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

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

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

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

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

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

Solution (Python):


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

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

Solution (Python):
import math
import heapq
from collections import Counter




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 = [int(s) for s in 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(max(C-(A-B),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=C-(A-B)
if D<=0:
   print(0)
else:
   print(D)

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):
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+b-a)

Solution (Python):




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

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

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

print(ans)

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())
if b+c > a:
  print(c-(a-b))
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 = [int(v) for v in input().split(' ')]

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

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

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

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

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

t = (b+c)-a

if t <= 0:
	t = 0

print(t)

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

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

ans = abc[2] - (abc[0] - abc[1])
if ans < 0:
    print(0)
else:
    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 = - A + B + C
if d < 0:
    d = 0
print(d)

Solution (Python):


def main():
    A,B,C= map(int, input().split())
    youki1_capa = A - B
    youki2_zan = C - youki1_capa
    if youki2_zan > 0:
        print(youki2_zan)
    else:
        print(0)

if __name__ == "__main__":
    main()

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

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

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

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

d = 0

d = c - (a - b)

if d < 0:
    d = 0

print(d)

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

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

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

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


print(temp)

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

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):
s = list(map(int, input().split()))
A = s[0]
B = s[1]
C = s[2]
cap = A - B
result = C - cap
if result < 0:
    result = 0
print(result)

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

Solution (Python):

abc=input().split()
a,b,c=int(abc[0]),int(abc[1]),int(abc[2])
 
print(max(0,c-(a-b)))

Solution (Python):
a, b, c = (int(i) for i in input().split())
anser = a - b
ansera= c - anser
if ansera <=  0:
  print("0")
else:
  print(ansera)

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:
  ans = 0
print(ans)

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

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

Solution (Python):
tmp = list(map(int, input().split()))
a = tmp[0]
b = tmp[1]
c = tmp[2]

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

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

for i in range(1,B+C):
    if A >= B + C:
        print(answer)
        exit()
    elif  A != B:
        B += 1
    elif A == B:
        answer = C - i+1
        print(answer)
        exit()

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

ans = a - b
ans = c - ans

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

Solution (Python):

container = list(input().split(' '))
for i in range(len(container)):
    container[i] = int(container[i])
a = container[2] - (container[0] - container[1]) >= 0
b = container[2] - (container[0] - container[1])
if a:
    print(b)

else:
    print(0)

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

1<=B<=A<=20
1<=C<=20

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

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


if __name__ == '__main__':
    a, b, c = map(int, input().split())
    print(t(a, b, c))

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

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

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

I = B+C         
L = C-(A-B)     

if I <= A:
    C = 0
    print(C)
else:
    print(L)

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

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

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

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

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

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

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

Solution (Python):
n = [int(i) for i in input().split()]
d = n[2] - (n[0] - n[1])
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(0, 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())
if a >= b+c:
    print(0)
elif a < b+c:
    print(b+c-a)

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

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

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

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

Solution (Python):
def main():
    a, b, c = [int(x) for x in input().split()]
    print(max(0,c-(a-b)))


if __name__ == '__main__':
    main()

Solution (Python):
a, b, c = (int(x) for x in input().rsplit())
cap = a - b
use = min(c, cap)
print(c - use)

Solution (Python):
A, B, C = map(int, input().split())
poss = A - B
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 res >= 0:
    print(res)
else:
    print(0)

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

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

x = min(C,A-B)
answer = C-x
print(answer)

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

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

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

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

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

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

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

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

can_ad_a = a - b




print(c - min(can_ad_a, c))

Solution (Python):
a, b, c = (int(x) for x in 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 res < 0:
    res = 0
print(res)

Solution (Python):
a,b,c = [int(x) for x in input().split()]
print(b+c-a if b+c-a > 0 else 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().strip().split()))
s = A - B
a = C - s
if a >= 0:
    print(a)
elif a < 0:
    print(0)

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

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

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

ans = int(abc[2]) - (int(abc[0]) - int(abc[1]))
if ans < 0:
    ans = 0
print(ans)

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

ans = int(abc[2]) - (int(abc[0]) - int(abc[1]))
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())

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

if c-d<=0:
  print(0)
else:
  print(c-d)

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

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

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

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())
e = a-b
d = c-e
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 = (int(x) for x in input().split())

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

print(ret)

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

if d < 0:
    d = 0

print(d)

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

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

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

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

E=C-D

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

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

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

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

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

Solution (Python):
'''A - Transfer
https://atcoder.jp/contests/abc136/tasks/abc136_a

>>> main(6, 4, 3)
1
>>> main(8, 3, 9)
4
>>> main(12, 3, 7)
0
'''


def main(a, b, c):
    print(max(c - (a - b), 0))


if __name__ == '__main__':
    a, b, c = map(int, input().split(' '))
    main(a, b, c)

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

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

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

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

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

if B >= 1 and A >= B and A <= 20 and C >= 1 and C <= 20:
    capacity = A - B
    if capacity <= C:
        remaining = C - capacity
    else:
        remaining = 0
    print(remaining)

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

Solution (Python):
import sys
input=sys.stdin.readline
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())
res = c-(a-b)
print (res if res > 0 else 0 )

Solution (Python):
a, b, c = map(int, input().split())
if a < b+c:
	print(abs(a-(b+c)))
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):
def slove():
    import sys
    input = sys.stdin.readline
    a, b, c = list(map(int, input().rstrip('\n').split()))
    print(c - min(a - b, c))


if __name__ == '__main__':
    slove()

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

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

Solution (Python):
def main():

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

if __name__ == '__main__':
    print(main())

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

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

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

if a-b <= 0:
  print(c)
elif 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 =(int(x) for x in 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(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(0, C-(A-B)))

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

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

Solution (Python):
a, b, c = [int(i) for i in 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 = list(map(int, input().split()))
print(max([0, B+C-A]))

Solution (Python):


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

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