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

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

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

Solution (Python):

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

out = C - (A-B)

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

Solution (Python):

import sys
stdin = sys.stdin

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

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

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

out = C - (A-B)

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

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

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

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

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

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

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

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

    
if __name__ == '__main__':
    q1()

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

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

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

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

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

Solution (Python):
data = list(map(int, input().split()))
A = data[0]
B = data[1]
C = data[2]

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

print(remain)

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(x) for x in input().split()]
print(max(0,c-a+b))

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

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

Solution (Python):
def resolve():

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

resolve()

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

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

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

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

a_ = a - b

transfer = min(a_, c)

print(c - transfer)

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
debugmode = False

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

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


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

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

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

Solution (Python):
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

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

Solution (Python):
import sys

def solve():
    input = sys.stdin.readline
    A, B, C = map(int, input().split())
    print(max(0, C - A + B))

    return 0

if __name__ == "__main__":
    solve()

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

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

Solution (Python):

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

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

if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect




from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

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

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

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

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

Solution (Python):
import os, sys, re, math

(A, B, C) = [int(n) for n in 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 = [int(s) for s in input().split()]

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

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

Solution (Python):
import sys

a, b, c = map(int, sys.stdin.readline().split())

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

if __name__ ==  '__main__':
    main()

Solution (Python):
import itertools
import fractions
def main():
  a,b,c = map(int,input().split())
  print(c - (a - b) if c-(a-b)>=0 else 0)
  
if __name__ == '__main__':
  main()

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

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

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

print(x)

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

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

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

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    sum = a[2] - (a[0] - a[1])
    
    if sum < 0:
        sum =0

    print(sum)

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

Solution (Python):

GBN_DEBUG = False
def dprn(s, i):
    if GBN_DEBUG: print(", " + s + " = " + str(i), end = "")
def dprns(s):
    if GBN_DEBUG: print(", " + s, end = "")
def dprni(i):
    if GBN_DEBUG: print(i, end=" ")
def endl(): 
    if GBN_DEBUG: print('')
def puts(s): print(s)






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





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

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

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

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

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

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

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

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

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

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())
print(c-a+b if c-a+b > 0 else 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())
if b+c-a >= 0:
    print(b+c-a)
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):
import math
import os
import random
import re
import sys

if __name__ == '__main__':
    a, b, c = list(map(int, input().rstrip().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)>0:
  print(C-(A-B))
else:
  print(0)

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

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

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

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

print(answer)

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

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

Solution (Python):
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A, B, C = lr()
cap = A - B
print(max(0, C-cap))

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

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

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

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

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

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

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

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

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

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

tmp = a-b

if c - tmp < 0:
    print(0)
else:
    print(c-tmp)

Solution (Python):












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

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

print(ans)

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
A, B, C = [int(i) for i 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())
c = c + b - a
if c >= 0:
    print(c)
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())
print(max(0,c-a+b))

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

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

Solution (Python):
a,b,c = map(int, input().split())
print(c - min(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 - Transfer
https://atcoder.jp/contests/abc136/tasks/abc136_a

"""
import sys


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


def main(args):
    A, B, C = map(int, input().split())
    ans = solve(A, B, C)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

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 = [int(i) for i in input().split()]
if  B + C <= A:
    print(0)
    exit()
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())

result = C - (A - B)

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

Solution (Python):
def solve():
    N, M, L = map(int, input().split())
    if N >= M+L:
        return 0
    return -(N-M-L)

print(solve())

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

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

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

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

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

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

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

Solution (Python):
import math
import sys


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

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

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

s = c-(a-b)

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

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

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

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

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

print(ans)

Solution (Python):

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

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

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

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

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(B+C-A,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())
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):
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement, groupby
from math import floor, ceil, sqrt, factorial, log
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict
from heapq import heappop, heappush, heappushpop
from itertools import product
import sys
stdin = sys.stdin
mod = 10**9 + 7


def ns(): return stdin.readline().rstrip()


def ni(): return int(ns())


def na(): return list(map(int, stdin.readline().split()))


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

Solution (Python):
from sys import stdin

a, b, c = (int(x) for x in stdin.readline().rstrip().split())
print(c-(a-b) if a-b<=c else 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)

print(ans if ans >= 0 else 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(" ")]
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 = list(map(int, input().split()))

ans = C - (A - B)

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

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

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

Solution (Python):





import sys

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

def main():
    a, b, c = list(map(int,ipti().split()))
    ans = max(0, c - (a - b))
    print(ans)

if __name__ == '__main__':
    main()

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

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

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

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



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

if __name__=='__main__':
  main()

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

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

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

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

d = c - (a - b)

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

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

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

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

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

temp1 = A-B
temp2 = C - temp1

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

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

Solution (Python):
import sys

a, b, c = map(int, sys.stdin.readline().split())

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

if __name__ == '__main__':
    ans = main()
    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+b-a))

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

if (A-B) < C:
    i = abs((A-B)-C)

else:
    i =0

print(i)

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

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

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

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

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

if c >= 0:
    print(c)
else:
    print('0')