Problem:
 Score : 100 points    Problem Statement We have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.  How many grams of sand will the upper bulb contains after t seconds?      Constraints  1≤X≤10^9  1≤t≤10^9  X and t are integers.         Input The input is given from Standard Input in the following format:  X  t       Output Print the number of sand in the upper bulb after t second.        Sample Input 1 100 17      Sample Output 1 83  17 out of the initial 100 grams of sand will be consumed, resulting in 83 grams.       Sample Input 2 48 58      Sample Output 2 0  All 48 grams of sand will be gone, resulting in 0 grams.       Sample Input 3 1000000000 1000000000      Sample Output 3 0

Solution (Python):
suna=input().split(" ")

if int(suna[1]) >= int(suna[0]):
	print("0")
else:
	sand= int(suna[0]) - int(suna[1])
	print(str(sand))

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

Solution (Python):
x, t = map(int, input().split())

if x > t:
    print(x - t)
else:
    print(0)

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

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

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

Solution (Python):
X,t=map(int,input().split())
print(max(0,X-t))

Solution (Python):
X,t=map(int,input().split())
print(0 if X-t<0 else X-t)

Solution (Python):
X_max, T_s = map(int, input().split())

ans = max(0, X_max - T_s)

print(ans)

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

Solution (Python):
X,t=map(int,input().split())
print(X-t if X-t>0 else 0)

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

Solution (Python):
X,t = map(int,input().split())
print(X-t if X-t >= 0 else 0)

Solution (Python):
x,t=map(int,input().split());print(max(x-t,0))

Solution (Python):
x, t = map(int, input().split())
result = x - t
if result > 0:
  print(result)
else:
  print('0')

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

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

Solution (Python):
import math

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

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

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

Solution (Python):
X, t = map(int, input().split())

if X >= t:
  print(X - t)
else:
  print(0)

Solution (Python):
x, t = map(int, input().split())
print(x - min(x, t))

Solution (Python):
X,t=map(int,input().split())
if X>t:
  print(X-t)
else:
  print(0)

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

Solution (Python):
x,t = map(int, input().split())
 
if x >= t:
  print(x-t)
else:
  print("0")

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

Solution (Python):
X,t = map(int,input().split())
if X > t:
    print(X-t)
else:
    print(0)

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

if x - t > 0:
    print(x - t)
else:
    print(0)

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

Solution (Python):
X, t = map(int, input().split())
print(X - t if X-t > 0 else 0)

Solution (Python):
X,t=map(int,input().split())

print((X-t)*(X>t))

Solution (Python):
X,t = map(int, input().split())

if X-t <= 0:
  print(0)
else:
  print(X-t)

Solution (Python):
X,t = map(int,input().split())

if X-t<=0:
  print(0)
else:
  print(X-t)

Solution (Python):
x, t = map(int, input().split())
ans = x - t
if ans < 0:
    print(0)
else:
    print(ans)

Solution (Python):
def main():
  x, t = map(int, input().split())
  if t > x:
    print(0)
  else:
    print(x-t)

if __name__ == '__main__':
  main()

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

Solution (Python):
x,t = map(int,input().split())

if x >= t:
    print(x - t)
else:
    print(0)

Solution (Python):
X,t=map(int,input().split())
print(max(0,X-t))

Solution (Python):
X, t = map(int, input().split())
if X-t > 0:
    print(X-t)
else:
    print(0)

Solution (Python):
import sys

def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))

def main():
    x, t = MII()
    print(max(x-t, 0))

if __name__ == '__main__':
    main()

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

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

Solution (Python):
X, t = map(int, input().split())
print(max(X-t, 0))

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

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

if t >= X:
  print("0")
else:
  print(X-t)

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

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

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

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

Solution (Python):
X, t = map(int, input().split())
print(X - t if X - t > 0 else 0)

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

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

Solution (Python):
x,t = map(int, input().split())

print(max(x-t,0))

Solution (Python):

x,t=map(int,input().split())

print(x-t if (x-t)>0 else 0)

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

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    x, t = mi()
    print(max(x - t, 0))


if __name__ == "__main__":
    main()

Solution (Python):
X,t = map(int,input().split())
print(X-t if X-t>0 else 0)

Solution (Python):
X, t = map(int, input().split())
ans = max(0,X-t)
print(ans)

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

Solution (Python):
X, t = map(int, input().split())
print(max((X - t), 0))

Solution (Python):
x = input().split()
X = int(x[0])
t = int(x[1])
if (X-t) > 0:
  print(X-t)
else:
  print(0)

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

Solution (Python):
X, t = map(int, input().split())
print(max(0, X - t))

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

x, t = map(int, readline().split())
print(max(0, x-t))

Solution (Python):
x, t = map(int, input().split())

if x > t:
    ans = x-t
else:
    ans = 0

print(ans)

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

Solution (Python):
X,t = map(int,input().split())

tmp = X-t

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

Solution (Python):
X, t = map(int, input().split())
print(max(X - t, 0))

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

Solution (Python):
X,t = map(int, input().split())
res = X - t
if res >= 0:
    print(res)
else:
    print(0)

Solution (Python):
X, t = map(int, input().split())
out = X-t
if out < 0:
    print(0)
else:
    print(out)

Solution (Python):
X,t=map(int,input().split())
if X>t:
    print(X-t)
else:
    print(0)

Solution (Python):
x, t = map(int, input().split())

ans = max(x - t, 0)
print(ans)

Solution (Python):
x, t = list(map(int, input().split()))
print(max(x - t, 0))

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

Solution (Python):
x, t = map(int, input().split())

ans = max(0, x - t)
print(ans)

Solution (Python):
x, t = map(int, input().split())

ans = max([0, x - t])
print(ans)

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

Solution (Python):
x,t=map(int,input().split())

print(max(x-t,0))

Solution (Python):
X,t = map(int,input().split())
ans = X-t

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

Solution (Python):
sand,t = map(int,input().split(" "))

if t >= sand:
  print(0)
  
else:
  print(sand - t)

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    x, t = map(int, input().split())
    print(max(0,  x - t))


if __name__ == '__main__':
    resolve()

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

Solution (Python):
x, t = map(int, input().split())
if x >= t:
  print(x-t)
else:
  print('0')

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

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

Solution (Python):

X, t = map(int, input().split())
print(max(0, X - t))

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

Solution (Python):
X,t=map(int,input().split())
if (X-t<0):
    print(0)
else:
    print(X-t)

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

Solution (Python):

"""
Created on Wed May 13 11:55:25 2020

@author: shinba
"""

x,t = map(int,input().split())

if x <= t:
    print(0)
else:
    print(x-t)

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





X,t = inputIL()

print(max(0,X-t))

Solution (Python):
import sys
import math
import bisect

def main():
    x, t = map(int, input().split())
    print(max(0, x - t))

if __name__ == "__main__":
    main()

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

Solution (Python):
X,t = map(int, input().split())
if X <= t:
    print(0)
else:
    print(X-t)

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

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

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

Solution (Python):
X, t = map(int, input().split())
print(X-t if X-t >0 else 0)

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

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

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    X, t = map(int, input().split())

    ans = max(0, X - t)

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
def main():
    x, t = map(int, input().split())
    if x < t:
        ans = 0
    else:
        ans = x - t
    print(ans)


if __name__ == "__main__":
    main()

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

Solution (Python):
X,t=map(int,input().split())
print(X-t if X>t else 0)

Solution (Python):
X, t = map(int, input().split())
if X >= t:
    print(X-t)
else:
    print(0)

Solution (Python):
def ABC_72_A():
    X,t = map(int, input().split())
    
    if X-t >=0:
        print(X-t)
    else:
        print(0)

if __name__ == '__main__':

    ABC_72_A()

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi

X, t = ri_()
print(max(0, X - t))

Solution (Python):
x, t = map(int, input().split())

print(max(x - t, 0))

Solution (Python):
X, t = list(map(int,input().split()))
if X - t > 0:
    print(X-t)
else:
    print(0)

Solution (Python):
x, t = map(int, input().split())

print(max(x-t,0))

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

Solution (Python):
X, t = map(int, input().split())
print(max(0, X-t))

Solution (Python):
def main():
    x,t = (int(x) for x in input().split())
    if x <= t: print(0)
    else: print(x-t)

if __name__ == '__main__':
    main()

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

Solution (Python):
x,t=map(int,input().split())
r=x-t

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

Solution (Python):
N,t = map(int,input().split())
if N-t>0:
    print(N-t)
elif N-t<=0:
    print(0)

Solution (Python):
def main():
    x,t = map(int,input().split())
    print(max(0,x-t))

if __name__ == '__main__':
    main()

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

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

Solution (Python):
X, t = map(int, input().split())
print(max(0, X - t))

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

Solution (Python):
x,t = map(int,input().split())
print([x-t,0][t>x])

Solution (Python):
x, t = map(int, input().split())
if x < t:
  print("0")
else:
  print(x-t)

Solution (Python):


X, t = map(int, input().split())


def main():
    print(max(0, X - t))

if __name__ == "__main__":
    main()

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

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

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

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

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

Solution (Python):
x, t = map(int, input().split())
r = x - t
if r < 0:
	r = 0
print(r)

Solution (Python):


X, t = map(int, input().split())

if X >= t:
    print(X-t)
else:
    print(0)

Solution (Python):
def resolve():
	x, t = map(int, input().split())
	print(x - t if x - t >= 0 else 0)
resolve()

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

Solution (Python):
x,t = map(int,input().split())
ans = x - t
if ans < 0: ans = 0
print(ans)

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

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, groupby
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
import numpy as np

X, t = MAP()

print(X-t if X > t else 0)

Solution (Python):
x, t = map(int, input().split())

print(max(0, x - t))

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

x,t = map(int,input().split())
print(max(0,x-t))

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

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

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

Solution (Python):
X,t=map(int,input().split())
print(max(0,X-t))

Solution (Python):
X, t = map(int, input().split())

print(max(X-t, 0))

Solution (Python):
X,t=map(int,input().split())
print(max(0,X-t))

Solution (Python):
X,t=map(int,input().split())
if X-t>0:
  print(X-t)
else:
  print(0)

Solution (Python):
x,t = map(int,input().split())

if x >= t:
  print(x -t)
else:
  print(0)

Solution (Python):
X, t = map(int, input().split())
if X-t < 0:
  print(0)
else:
  print(X-t)

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

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

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

Solution (Python):
x,t=map(int,input().split())
ans=max(0,x-t)
print(ans)

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

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

Solution (Python):



X, t = map(int, input().split())


ans = max(0, X - t)


print(ans)

Solution (Python):
from sys import stdin


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    X, t = list(map(int,_in[0].split(' ')))  
    
    cnt = max(X-t,0)
    
    print(cnt)

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

Solution (Python):
def main():
    X, t = (int(i) for i in input().split())
    print(max(X-t, 0))


if __name__ == '__main__':
    main()

Solution (Python):
X,t=map(int, input().split())

print(max(X-t, 0))

Solution (Python):
X, t = map(int,input().split())
print(max(0,X-t))

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

Solution (Python):
X, t = map(int, input().split())

print (max(0, X - t))

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

Solution (Python):
X,t=map(int, input().split())
print(max(0,X-t))

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

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

def resolve():
    x,t=map(int, input().split())
    print(max(0,x-t))
resolve()

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

Solution (Python):
def resolve():
  x, t = map(int, input().split())
  print(max(x-t, 0))
  return

if __name__ == "__main__":
  resolve()

Solution (Python):
def main():
    x, t = map(int, input().split())
    print(max(x - t, 0))


if __name__ == '__main__':
    main()

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

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

Solution (Python):
X,T = map(int,input().split())
print(max(X-T,0))

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

Solution (Python):
X, t = map(int, input().split())
print(max(0, X - t))

Solution (Python):
x,t=map(int,input().split())
print(max([x-t,0]))

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

x,a=MI()
print(max(x-a,0))

Solution (Python):
X,t=map(int,input().split())
print(max(X-t,0))

Solution (Python):
x = input().split()
X = int(x[0])
t = int(x[1])
if (X-t) > 0:
  print(X-t)
else:
  print(0)

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

Solution (Python):
X,t=map(int,input().split())
print(X-t)if X>t else print(0)

Solution (Python):
X,t = map(int,input().split())

print(max(0,X-t))

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

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

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

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

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

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

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

Solution (Python):
X,t=map(int,input().split())
print(X-t if X-t>0 else '0')

Solution (Python):
X, t = map(int, input().split())
print(max(X-t, 0))

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

Solution (Python):
X,t = map(int, input().split())
print(max(0, X - t))

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

Solution (Python):
X, t = map(int, input().split())

if (X - t) >= 0:
    print((X-t))
else:
    print(0)

Solution (Python):
x, t = list(map(int, input().split()))
print(0) if t >= x else print(x - t)

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

Solution (Python):

def resolve():
    X, t = list(map(int, input().split()))
    print(max(0, X - t))


if '__main__' == __name__:
    resolve()

Solution (Python):
x,t=[int(i)for i in input().split()]
if x>t:
  print(x-t)
else:
  print('0')

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    X,t=map(int,input().split())
    ans=X-t
    print(ans if ans>=0 else 0)

if __name__ == '__main__':
    main()

Solution (Python):
X,t = map(int,input().split())
print(max(0,X-t))

Solution (Python):
x,t=map(int,input().split())
print([x-t,0][int(0>=x-t)])

Solution (Python):
k=eval(input().replace(" ","-"));print(max(0,k))

Solution (Python):
x, t = map(int, input().split())
if x >= t:
    print(x-t)

elif x < t:
    print("0")

Solution (Python):
x, t = map(int, input().split())

print(max(x - t, 0))

Solution (Python):
def resolve():
    x,t=map(int,input().split())
    print(x-t if x-t>=0 else 0)
resolve()

Solution (Python):
X, t = map(int,input().split())
print(max(X-t, 0))

Solution (Python):
X, t = map(int, input().split())
print(max(0, X-t))

Solution (Python):
X,t=map(int,input().split())
if X-t>=0:
  print(X-t)
else:
  print(0)

Solution (Python):
x,t=map(int, input().split())

A=x-t

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

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

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

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

Solution (Python):
X, t = map(int, input().split())
if X < t:
  print(0)
else:
  print(X-t)

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

Solution (Python):
x,t=map(int,input().split())

if x>t:
    print(x-t)
else:
    print(0)

Solution (Python):
X,t=map(int, input().split())
if X<t:
  print(0)
else:
  print(X-t)

Solution (Python):
X, t = map(int, input().split())

print(max(0, X - t))

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

Solution (Python):
X,t=map(int,input().split())
if X<t:
    print(0)
else:
    print(X-t)

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

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

Solution (Python):
x,t = list(map(int,input().split()))
print(max(0,x-t))

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

Solution (Python):
X, t = map(int, input().split())
print(0 if X <= t else X-t)

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

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

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

Solution (Python):
X,t = map(int,input().split())
print(max(X-t,0))

Solution (Python):
x, t = map(int, input().split())
if(x>t):
    print(x-t)
else:
  print("0")

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

print(max(s-t, 0))

Solution (Python):
x, t = map(int, input().split())
ans = 0 if x < t else x - t
print(ans)

Solution (Python):
X, t = map(int, input().split())
print(max(0, X-t))

Solution (Python):
x, t = map(int,input().split())

if ( x - t ) > 0:
  print(x-t)
  
else:
  print(0)

Solution (Python):
X, t = map(int, input().split())
if X>t:
  print(X-t)
else:
  print(0)

Solution (Python):
icase=0    
if icase==0:
    x,t=map(int,input().split())
    if x>t:
        print(x-t)
    else:
        print(0)

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

Solution (Python):
def main():
    x, t = map(int, input().split())

    if x - t >= 0 :
        print(x - t)
    else:
        print(0)
main()

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

Solution (Python):
x,t=map(int,input().split())
p=x-t
if (x-t)<0:
  p=0
print(p)

Solution (Python):
x, t = map(int, input().split())

if x - t >= 0:
    print(x-t)
else:
    print(0)

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

Solution (Python):
X,t=map(int,input().split())
print(X-t) if X>=t else print(0)

Solution (Python):
X,t = map(int,input().split())

print(X-t if(X-t)>0 else 0)

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

Solution (Python):
x, t = map(int, input().split())
ans = max(0, x - t)
print(ans)

Solution (Python):
X,t = map(int,input().split())

if X >= t:
    print(X-t)
else:
    print(0)

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

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

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

Solution (Python):
X, t = map(int, input().split())
print(max(0,X-t))

Solution (Python):
x, t = map(int, input().split())
if (x - t) <= 0:
    print('0')
else:
    print(x-t)

Solution (Python):
X, t = map(int, input().split())
print(X-t if X >=t else '0')

Solution (Python):
n, m = map(int, input().split())
print(n-m) if n >= m else print(0)

Solution (Python):
X, t = map(int, input().split())

ans = X - t
if ans < 0:
    ans = 0
print(ans)

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

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

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

Solution (Python):
print(max(eval(input().replace(" ","-")),0))

Solution (Python):
X, t = map(int, input().split())
R = X - t
if (R > 0):
    print(R)
else:
    print(0)

Solution (Python):
X, t = map(int, input().split())
print(max(X - t, 0))

Solution (Python):
x,t = map(int, input().split())

print(max(0, x-t))

Solution (Python):
X,t = map(int,input().split())
print(max(0,X-t))

Solution (Python):
X,t = map(int,input().split())
 
if t >= X:
  print(0)
else:
  print(X-t)

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

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

Solution (Python):
x,t=[int(i) for i in input().split()]


if x<t:
    print(0)
else:
    print(x-t)

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

Solution (Python):
X,t = map(int, input().split())
if X - t > 0:
  print(X - t)
else:
  print(0)

Solution (Python):
x,t = map(int,input().split())

if x >= t:
  print(x - t)
else:
  print(0)

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

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

X, t = map(int, input().split())
print(max(0, X -t))

Solution (Python):
x, t = map(int, input().split())
ans = max(0, x-t)
print(ans)

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

if (x - t) > 0:
    print(x - t)
else:
    print(0)

Solution (Python):
x, t = map(int, input().strip().split())

rest = max(x - t, 0)

print(rest)

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

Solution (Python):
X,t=map(int,input().split())
if X>t:
    print(X-t)
else:
    print("0")

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

Solution (Python):
X, t = map(int, input().split())

print(max(0, X - t))

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

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

Solution (Python):
X, t = map(int, input().split())
print(max(0, X - t))

Solution (Python):

X, t = map(int, input().split())
ans = X - t
if ans < 0:
    ans = 0
print(ans)

Solution (Python):
x,t=map(int,input().split())
d=x-t
print(d if d>0 else 0)

Solution (Python):
x, t = map(int, input().split())
print(max([0, x-t]))

Solution (Python):


X, t = map(int, input().split())

diff = X - t

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

Solution (Python):
x, t = map(int, input().split())

ans = x - t
if ans <= 0:
    print(0)
else:
    print(ans)