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



Sample input:
6 4 3


Sample output:
1

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
while True:
    ABC=list(map(int,input().split(" ")))
    
    if len(ABC)==3 and ABC[0]<=20 and ABC[1]<=ABC[0]:
        break

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

empty1=a-b
if c-empty1>0:
    empty2=c-empty1
elif c-empty1<=0:
    empty2=0

print(empty2)

Submission status: Accepted

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

x = a - b
z = c - x
if z <= 0 :
    z = 0
print(str(z))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
d=c-(a-b)
print([d,'0'][d<=0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
ans = 0

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import exit, stdin
A, B, C = [int(_) for _ in stdin.readline().rstrip().split()]
if C-A+B > 0:
    print(C-A+B)
else:
    print(0)

Submission status: Accepted

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

d = c-a+b

if d >=0:
	print(d)

else:
	print("0")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ABC = list(map(int,input().split()))
A = ABC[0]
B = ABC[1]
C = ABC[2]
if (A>(B+C)):
    print(0)
else:
    D = A-B
    a = C - D
    print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num=list(map(int,input().split()))

sum=num[0]-num[1]

ans=num[2]-sum

if ans <=0:
  ans=0

print(ans)

Submission status: Accepted

Solution code:
n,m,l = input().split()
n = int(n)
m = int(m)
l = int(l)

x = l - n + m
print(x if x>=0 else 0)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

x =(a-b)-c
if x >0:
  print("0")
else:
  print(x*-1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin

param = input().split()
A=int(param[0])
B=int(param[1])
C=int(param[2])

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

D = C-(A-B)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
answer=B+C-A

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

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

limit = a - b
ans = c - limit

if ans < 0:
	ans = 0

print(ans)

Submission status: Accepted

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

d = c - (a - b)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2sss = lambda n: [list(sys.stdin.readline().rstrip()) for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))
from collections import deque  # 双方向キュー
from collections import defaultdict  # 初期化済み辞書
from heapq import heapify, heappush, heappop, heappushpop  # プライオリティキュー
from bisect import bisect_left, bisect_right  # 二分探索
sys.setrecursionlimit(int(1e+6))
MOD = int(1e+9) + 7
#import numpy as np  # 1.8.2
#import scipy  # 0.13.3

def main():
    A, B, C = i2nn()
    n = max(C - (A - B), 0)
    print(n)

main()

Submission status: Accepted

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

x = min(a-b, c)
ans = c - x
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding:utf8 -*-

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
asize,bwater,cwater = map(int,input().split())

if bwater + cwater >= asize:
    cnokori = cwater - (asize - bwater)
    print(cnokori)

else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
while True:
    try:
        A, B, C = map(int, input().split())
        print(max(0, C-(A-B)))
    except:
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nums = input().split(" ")
a_b = int(nums[0]) - int(nums[1])
c = int(nums[2])
if a_b >= c:
  n = 0
else:
  n = c - a_b
print(n)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
x = i[2]-(i[0]-i[1])
if x <= 0:
  print('0')
else:
  print(x)

Submission status: Accepted

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

mv_water = min(a - b, c)

print(c - mv_water)

Submission status: Accepted

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

Submission status: Accepted

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

acceptable = a - b
remaining = 0

if c - acceptable <= 0:
    remaining = 0
else:
    remaining = c - acceptable

print(remaining)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = [int(x) for x in input().split(" ")]
 
rest = a - b
ans = c - rest
if ans < 0:
  ans = 0
 
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

s = a-b

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    a, b, c = list(map(int, input().rstrip('\n').split()))
    print(max(c - (a - b), 0))


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a, b, c = map(int, input().split())
# 容器1の残量
rest = a-b
if c < rest:
    print(0)
else:
    print(c-rest)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = [int(i) for i in input().split()]
cap = a - b
trans = cap if c >= cap else c
print(c - trans)

Submission status: Accepted

Solution code:
vol1_total, vol1_now, vol2_now = map(int, input().split(" "))

vol1_available = vol1_total - vol1_now
vol2_remain = vol2_now - vol1_available
if vol2_remain < 0:
    print("0")
else:
    print(vol2_remain)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ABC = input().split()
A = int(ABC[0])
B = int(ABC[1])
C = int(ABC[2])

ans = C - (A - B)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


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



# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c,= [int(x) for x in input().split()]
n = c -(a-b)
if n > 0:
    print(n)
else:
    print(0)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C =(int (i) for i in input().split())
z = A - B
d = C - z
if d < 0:
    d = 0
print(int(d))

Submission status: Accepted

Solution code:
A,B,C =input().split()
z = int(A) - int(B)
d = int(C) - z
if d < 0:
    d = 0
print(int(d))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

answer = C-A+B

if answer >= 0:
	print(answer)

else :
	print(0)

Submission status: Accepted

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

d = a-b

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

Submission status: Accepted

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

Submission status: Accepted

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

rest = A - B
C_rest = C - rest
if C_rest < 0:
    C_rest = 0

print(C_rest)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c = [int(x) for x in input().split()]
print(c-(a-b)) if (c-(a-b)) >= 0 else print("0")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

d = a - b

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# インプットの入力
A, B, C = map(int, input().split())

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

# 出力
print("{0}".format(X))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
v = [int(s) for s in input().split(" ")]
A = v[0]
B = v[1]
C = v[2]

r = C - A + B

print(r) if r > 0 else print(0)

Submission status: Accepted

Solution code:
num = list(map(int,input().split()))
a = num[0] 
b = num[1] 
c = num[2]
ans = c - (a - b) 

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding: utf-8
i = list(map(int,input().split()))
if i[0] < i[1]+i[2]:
    l = i[1]+i[2]-i[0]
    print(l)
    
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
limit, nowl, addl = map(int, input().split())
print(max(0, nowl+addl-limit))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


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


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

spac = a - b
ans  = c - spac

if 0 > ans:
  ans = 0

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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


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

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = C-(A-B)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if diff >0:
    ans = C - diff

print(max(ans, 0))

Submission status: Accepted

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

aki = a - b

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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