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

res = c - a + b

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

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

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

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

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

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

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

C -= A - B

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

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

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

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

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

empty = a - b 

new = c - empty

if new>0:
    print(new)
else:
    print('0')

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

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

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

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

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

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

    
if '__main__' == __name__:
    resolve()

Solution (Python):
import sys, math
from collections import defaultdict
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 1000000007
sys.setrecursionlimit(1000000)

A, B, C = rl()

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

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 C+B>=A:
  print(C+B-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 = list(map(int, input().split()))
x = a[0]
y = a[1]
z = a[2]

if y + z > x:
    print(z-x+y)
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())
ans = max((B+C)-A,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())
print(max(0, b + c - a))

Solution (Python):



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

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

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

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

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

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

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

d = A - B

e = C-d

if 0 < e:
    print(e)

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

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


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

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

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

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

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

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

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

if __name__ == '__main__':
    main()

Solution (Python):
import sys







input = sys.stdin.readline
sys.setrecursionlimit(10**7)
inf = 10**17
mod = 10**9 + 7

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

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

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

Solution (Python):

a,b,c=map(int,input().split())
t=a-b-c
print(-t*(t<0)or 0)

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

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

Solution (Python):
print(max(0,eval('-'+input().replace(*' +'))))

Solution (Python):
print(max(0,eval('-'+input().replace(*' +'))))

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

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

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

while c>0:

    if a>=b+1:
        b+=1

    elif a<b+1:
        break
    
    c-=1

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

ans = c - (a - b)
if ans < 0:
    print(0)
else:
    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 = [int(i) for i in input("").split(" ")]
c-= a-b
if c > 0:
  print(c)
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(c-(a-b), 0))

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    A, B, C = map(int, readline().split())
    if C < A - B:
        print(0)
    else:
        print(C - A + B)
    
    return


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

while b < a:
    c -= 1
    b += 1
    if c == 0:
        break

print(c)

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

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

main()

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

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

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

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

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

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

A, B, C = MI()

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

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


result = b + c - a

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

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

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

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

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

Solution (Python):
import sys
a=sys.stdin.readline()
res=[i for i in a.split()]
A,B,C=[float(res[i]) for i in (0,1,2)]
E,F,G=A.is_integer(),B.is_integer(),C.is_integer()
if E==F==G==True:
    if 1<=B<=A<=20 and 1<=C<=20:
        w=C-A+B
        if w<0:
            print(0)
        else:
            print(int(w))

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

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

Solution (Python):
x,y,z = [int(a) for a in input().split()]

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

Solution (Python):
x,y,z = [int(a) for a in input().split()]

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

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

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

[A, B, C] = [int(x) for x in sys.stdin.readline().strip().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())
if c-(a-b)>=0:
    print(c-(a-b))
else:
    print("0")

Solution (Python):
def solve():
    a, b, c = map(int, input().split())
    print([0, c-a+b][c-a+b>0])

if __name__ == '__main__':
    solve()

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

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

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

Solution (Python):
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions
from operator import itemgetter
import itertools


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor



dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
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())
a = A - B
ans = C - a
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())
print(max(0,c-(a-b)))

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

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

Solution (Python):
bottle_1_max , bottle_1_input ,bottle_2_input = map(int,input().split())
bottle_2 = bottle_1_max -bottle_1_input - bottle_2_input
if bottle_2 >= 0:
  print(0)
else:
  print(abs(bottle_2))

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 -= b

c -= a

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

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

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)



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

Solution (Python):
import sys

input = lambda: sys.stdin.readline().rstrip()


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


if __name__ == '__main__':
    solve()

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

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

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

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

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

if __name__ == "__main__":
    main()

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

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

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

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(a) for a in input().split())
x = C - (A - B)
if x <= 0 :
    print(0)
else : print(x)

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

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    a, b, c = map(int, input().split())
    print(max([c - a + b, 0]))


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Solution (Python):
import sys


def input():
    return sys.stdin.readline().strip()

def main():
    a, b, c = map(int, input().split())
    if a-b>=c:
        print(0)
        return
    print(c-a+b)
    
main()

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

res1 = A - B

if res1 <= C:
    trans = res1
else:
    trans = C

print(C - trans)

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

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

ret = argList[2] - (argList[0]-argList[1])

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

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

Solution (Python):
a, b, c = [int(x) for x in 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):
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())
cap=A-B
C-=min(cap, C)
print(C)

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

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

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

Solution (Python):

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

Solution (Python):
def main():
  num = list(map(int,input().split()))
  if num[1]+num[2]-num[0]<0:
    print(0)
  else:
    print(num[1]+num[2]-num[0])
main()

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

Solution (Python):


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

capa_a = a-b

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

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


if __name__ == '__main__':
    main()

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

import sys
input = sys.stdin.readline









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

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

S = A - B

if C - S > 0:
    print(C - S)
else:
    print(0)

Solution (Python):



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


if __name__ == '__main__':
    main()

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):
import math
a,b,c = (int(x) for x in 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<0:
    print(0)
else:
    print(b+c-a)

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

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
a, b, c = M()
print(max(c-(a-b), 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=list(map(int,input("").split(" ")))

rem=a-b


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

Solution (Python):
x, y, z = map(int, input().split())
if z-x+y > 0:
    print(z-x+y)
else:
    print(0)

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

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

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

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

a -= b

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

Solution (Python):
import math

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

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

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

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

Solution (Python):
def transfer(a, b, c):

    return 0 if a > b+c else c+b-a
def main():
    a, b, c = map(int, input().split())
    print(transfer(a, b, c))

if __name__ == '__main__':
    main()

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

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

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

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(b+c-a if a<b+c else 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())
R=A-B
print((C-R)*(C>R))

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    a, b, c = LI()
    d = max(0, c - (a - b))
    print(d)


main()

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

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

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

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

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