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

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

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B ,C = MAP()

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):
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read 
input = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines  

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

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

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

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

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

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


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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




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


if __name__ == "__main__":
    main()

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

X1 = B
X2 = C

move = min(A - B, C)

X1 += move
X2 -= move

print(X2)

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

ans = C - (A-B)

if ans > C:
    ans = C
elif ans < 0:
    ans = 0

print(ans)

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

limit = A - B
res = C - min(limit, C)

print(res)

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

limit = A - B
res = C - limit

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

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

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

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

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

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

d = a - b
c = c - (a - b)

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
abc = list(map(int, input().split()))
a, b, c = abc[0], abc[1], abc[2]
result = c - (a - b)
if result >= 0:
    print(result)
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 = [int(i) for i in input().rstrip().split(' ')]
r = C-A+B
if r < 0:
    r = 0
print(r)

Solution (Python):
import sys
row = sys.stdin.readline
def read_ints(row):
    return list(map(int, row().split()))
  
A,B,C = read_ints(row)
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 c-(a-b)>0:
    print(c-(a-b))
else:
    print(0)

Solution (Python):




def solve(A, B, C):
    ans = A - B - C
    if ans < 0:
        ans = abs(ans)
    else:
        ans = 0
    return ans




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









print(solve(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 c < a-b:
  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(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())

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

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

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

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

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

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

Solution (Python):
def LI():
	return [int(s) for s in input().split()]

A,B,C = LI()
      
print(C - (A-B)) if C-(A-B) > 0 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):
numbers = input().split()
numA = int(numbers[0])
numB = int(numbers[1])
numC = int(numbers[2])
x = numB + numC - numA
if x > 0:
  print(x)
else:
  print(0)

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

space = A - B

print(max(0, C - space))

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

Solution (Python):
x = input().split(" ")
a = int(x[0])
b = int(x[1])
c = int(x[2])

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

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

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

x = A - B

if C <= x:
    res = 0
else:
    res = C - x

print(res)

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

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

    x = a - b - c

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

if __name__ == '__main__':
    main()

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

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

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

req = b + c

print((req - a) if req > a else 0)

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

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

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

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

cnt = c - a + b

if(cnt < 0):
  cnt = 0

print(cnt)

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

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

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

print(max(r, 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())

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

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

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

Solution (Python):
import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res
def gcd(x, y):
    if x < y: x, y = y, x
    div = x % y
    while div != 0:
        x, y = y, div
        div = x % y
    return y

A,B,C=LI()

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

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

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

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

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

Solution (Python):
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

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

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

remain1 = A - B

if C - remain1 < 0:
    print(0)
else:
    print(C-remain1)

Solution (Python):
waterA,waterB,waterC = map(int,input().split())
answer = waterB + waterC - waterA
if answer < 0:
    answer = 0

print(answer)

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

ans = C - (A-B)

if ans > C:
    ans = C
elif ans < 0:
    ans = 0

print(ans)

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

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

print(ans)

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

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

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

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

ans = c - a + b

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

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

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

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

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

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

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

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

a = C - (A - B)

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

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

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

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

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

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

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

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

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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b,c=INTM()
    if a<=b+c:
        print(b+c-a)
    else:
        print(0)
if __name__ == '__main__':
    do()

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

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

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

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

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

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

container1 = A - B
container2 = C - container1

print(container2 if container2 >= 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())

space = A - B

ans = C - space

ans = ans if ans >= 0 else 0

print(ans)

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

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

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

 
if __name__ == '__main__':
	main()

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

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

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

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

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

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

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

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

if li[2]-(li[0]-li[1])>0:
    print(li[2]-(li[0]-li[1]))
else:
    print(0)

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

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

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

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

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

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

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

print(c - min(tmp, c))

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

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

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

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

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

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

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

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):
from sys import stdin

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

print(max(c - d,0))

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

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

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

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

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

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

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

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

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

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

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

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

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

input_list = list(map(int,input().split()))
a = input_list[2] + input_list[1] - input_list[0]
if a > 0:
    print(a)
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 = (int(i) for i in input().split())
ans = max(c-(a-b),0)
print(ans)

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

Solution (Python):
p,q,r=map(int,input().split())
print(max(r-(p-q),0))

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

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

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

if c-a+b < 0:
    ans = 0
else:
    ans = c-a+b

print(ans)

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

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

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

Solution (Python):
A, B, C = [int(x) for x in input().split()]
if A<=B+C:
    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().rstrip().split())

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

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

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

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

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

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

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

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

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

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

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

if b + c <= a:
    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):
l=list(map(int, input().split()))
A, B, C = l[0], l[1], l[2]

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

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

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

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

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

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

c_left = C - (A - B)

ans =  c_left if c_left >= 0 else 0
print(ans)

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

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

nokori = C - (A-B)

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

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

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

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

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

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

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

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

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

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

Solution (Python):
A, B, C = 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())

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

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

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

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

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

Solution (Python):
N = input().split(' ')
A = int(N[0])
B = int(N[1])
C = int(N[2])
x = A -B
result = C - x
if result < 0:
    print(int('0'))
else:
    print(result)

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

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

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

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

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

Solution (Python):
def solve():

    i = list(map(int, input().split()))
    A = i[0]
    B = i[1]
    C = i[2]

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

solve()

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

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

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

if s[0]-s[1]>s[2]:
  print(0)
else:
  print(s[2]-(s[0]-s[1]))

Solution (Python):

import math
import datetime





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