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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
i = input().split()
max = int(i[0])
n = int(i[1])
m = int(i[2])
r = m - (max - n )
print(r)

Submission status: Wrong Answer

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

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

print(c-(a-b))

Submission status: Wrong Answer

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

a, b, c  = int(a), int(b), int(c)

dif = a - b

print(c - dif)

Submission status: Wrong Answer

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

a, b, c  = int(a), int(b), int(c)

Submission status: Wrong Answer

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

print(b-a+c)

Submission status: Wrong Answer

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

get = A - B

i = C - get

print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys, math, bisect, random, itertools
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b, c = LI()
    print(min(b+c,a))
    return

#B
def B():
    n = II()
    ans = 0
    for i in range(1, n + 1):
        if len(str(i)) % 2:
            ans += 1
    print(ans)
    return

#C
def C():
    n = II()
    h = LI()
    h = h[::-1]
    for i in range(1, n):
        if h[i] <= h[i-1]:
            continue
        if h[i] == h[i - 1] + 1:
            h[i] -= 1
            continue
        print("No")
        return
    print("Yes")
    return

#D
def D():
    s = S()
    lens = len(s)
    ans = [0] * len(s)
    i = 0
    while i != len(s):
        for j in range(i, lens):
            if s[j] == "R":
                continue
            break
        R = j - i
        for i in range(j, lens):
            if s[i] == "L":
                continue
            break
        else:
            i += 1
        L = i - j
        ans[j] = R // 2 + (L+1) // 2
        ans[j - 1] = L // 2 + (R+1) // 2

    print(*ans)
    return

#E
def E():
    return

#F
def F():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B, C = [int(abc) for abc in input().split()]
print(B + C - A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print( b + c - a )

Submission status: Wrong Answer

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

C = C - (A - B)

print(C)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

res = str(input())
print(res)
list = res.split(" ")

a = int(list[0])
b = int(list[1])
c = int(list[2])
transferrable = a - b

if c <= transferrable:
    c = 0

else:
    c -= transferrable

print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

empty = a - b
remain = c - empty

print(remain)

Submission status: Wrong Answer

Solution code:
x = input()
A, B, C = [int(y) for y in x.split(" ")]
print(C-(A-B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import logging

logging.basicConfig(level=logging.INFO, format="%(message)s")
#logging.disable(logging.CRITICAL)

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

    print(B + C - A)
    
    
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = list(map(int, input().split()))
print(s[2]-s[0]+s[1])

Submission status: Wrong Answer

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

x=C-(A-B)
print(x)

Submission status: Wrong Answer

Solution code:
def main():
    output = C - A + B
    if output < 0:
        return 0
    return output

Submission status: Wrong Answer

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


if a == b:
    num1 = a
else:
    num1 = a - b

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
inp = input().split()
a = int(inp[0])
b = int(inp[1])
c = int(inp[2])

def move():
    tmp = a-b
    # 5-3
    print(c - tmp)

move()

Submission status: Wrong Answer

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

sa_youki1 = a - b

sa_youki2 = c- sa_youki1

if sa_youki2 <-1:
    sa_youki2 =0
print(sa_youki2)

Submission status: Wrong Answer

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

result = c - (a - b)
print(result)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
left_in_c = c - (a -b )
print("{}".format(left_in_c));

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
s = input().rstrip().split(' ')
print(int(s[2])+int(s[1])-int(s[0]))

Submission status: Wrong Answer

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

print(abs((A-B) - C))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

ABC =  list(int(i) for i in input().split())
"""
ABC=[8,3,9]
"""
ans = ABC[2]-ABC[0]+ABC[1]
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

C=C-(A-B)
print(C)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if a == b:
    num1 = a
else:
    num1 = a - b

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python

def main(A, B, C):
    ans = C - (A - B)
    return ans

if __name__ == '__main__':
    A, B, C = list(map(int, input().split()))
    print(main(A, B, C))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = list(map(int, input().strip().split()))
ans = min(a, b + c)
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def rest_of_water(a, b, c):
   output = c-(a-b)
   if output < 0:
   	    output = 0
   return output

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

one = a - b
two = c
print(two-one)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from enum import Enum
from queue import Queue
import collections

import sys
import math

BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001

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

Submission status: Wrong Answer

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

print(c-(a-b))

Submission status: Wrong Answer

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

print(b+c-a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# coding: utf-8

# In[ ]:


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


# In[ ]:


print(int(C-(A-B)))

Submission status: Wrong Answer

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

print(C-A+B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(C - (A - B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
def main():
    A,B,C = map(int,input().split())
    print(C-(A-B))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()

S = list(map(int, S.split()))

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

print(C-(A-B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# coding: utf-8

# In[ ]:


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


# In[ ]:


print(int(C-A-B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

diff = (a-b)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
#ARC65C
import copy
import sys
#import math

tmp = input().split()
hoge = list(map(lambda a: int(a), tmp))
#print(hoge)
a=hoge[0]
b=hoge[1]
c=hoge[2]

print(c-(a-b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(s)

Submission status: Wrong Answer

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

print(c-(a-b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(a)

Submission status: Wrong Answer

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

ans = 0

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


print (c - (a - b))

Submission status: Wrong Answer

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

print(b+ c -a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a, b, c = map(int, input().split())
print("{}".format(c-(a-b)));

Submission status: Wrong Answer

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

nokori = A-B

print(C-nokori)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = [int(i) for i in input().split(" ")]
print(a[2]-(a[0]-a[1]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(c - (a-b))

Submission status: Wrong Answer

Solution code:
import decimal
decimal.getcontext().prec = 100
def sum1(pre,l,r):
    l=max(l,0)
    if(l==0):
        return pre[r]
    return pre[r] - pre[l - 1]

# n=int(raw_input())
a,b,c=map(int,raw_input().split())
if(b+c<=a):
    print 0
    exit()
print (b+c)%a
# t=1
# while(t!=0):
#     t=t-1

Submission status: Wrong Answer

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

c = A-B

print(C-c)

Submission status: Wrong Answer

Solution code:
def int_multiple():
    return  [int(c) for c in input().split()]

def int_single():
    return int(input())

def str_multiple():
    return [c for c in input().split()]

def str_single():
    return input()

# start
a, b, c = int_multiple()

print(c-(a-b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = a

if a > b+c:
  ans = b+c

print(ans)

Submission status: Wrong Answer

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

print(c-(a-b))

Submission status: Wrong Answer

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

print(C-(A-B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

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

Submission status: Wrong Answer

Solution code:
import sys

def main():
    A,B,C = tuple(map(int, sys.stdin.readline().split()))

    print(C-(A-B))

if __name__=='__main__':
    main()

Submission status: Wrong Answer

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


def main():
    a, b, c = map(int, input().split())
    print('%d' % (c - (a - b)))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

print(b+c-a)

Submission status: Wrong Answer

Solution code:
# チートシート
a, b, c = map(int, input().split())
tmp = a-b
print(c-tmp)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main(a, b, c):
    return c - (a - b)


if __name__ == '__main__':
    i = list(map(int, input().split()))
    a, b, c = i[0], i[1], i[2]
    print(main(a, b, c))

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

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

d = a-b
print(c-d)

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

print(b+c-a)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
n=input().split(" ")
print(int(n[2])-int(n[0])+int(n[1]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import defaultdict, deque
import sys

sys.setrecursionlimit(100000)

MIN = -10 ** 9
MAX = 10 ** 9 + 7


def main():
    # N = int(input())
    a, b, c = [int(a) for a in input().split()]
    # # A = [
    # #     int(input())
    # #     for _ in range(N)
    # # ]
    # A = [int(a) for a in input().split()]

    print(c - a + b)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

C -= (A - B)
print(C)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


def solve(A: int, B: int, C: int):
    print(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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

#n = int(input())
a, b, c = [int(i) for i in input().split()]
#table = [[int(i) for i in input().split()] for j in range(n)]
#table = [list(input()) for n in range(h)]
#list = [int(i) for i in input().split()]
#num = [int(i) for i in range(n)]
#s = [input() for i in range(n)]
#s = input()
#list = list(s)
#temp = [[0 for _ in range(13)] for _ in range(13)]

print(c-(a-b))

Submission status: Wrong Answer

Solution code:
num = input().split()
print(int(num[2])-int(num[0])+int(num[1]))

Submission status: Wrong Answer

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

print(C - (A-B))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

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

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


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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:


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


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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#136-A

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

#print(C - A + B)

ans = C - A + B

if ans <= 0:
    print(0)

else:
    print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

f1 = a - b
f2 = c - f1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def water(A, B, C):
    result = C - (A - B)
    return max(0, result)


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

print(water(A, B, C))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#   Transfer

def return_residue(a, b, c):
    residue = c - (a - b)
    return max(0, residue)


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

print(return_residue(a, b, c))

Submission status: Accepted

Solution code:
#   Transfer

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

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

print(residue)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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