Submission #4246061

---

Source Code Expand

#!usr/bin/env python3
from collections import defaultdict
import math
import bisect
import random
def LI(): return list(map(int, input().split()))
def II(): return int(input())
def LS(): return input().split()
def S(): return input()
def IIR(n): return [II() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
mod = 1000000007

#A

#B

#C
t = II()
n = II()
a = LI()
m = II()
b = LI()
for i in range(m):
    j = 0
    if len(a) == 0:
        print("no")
        quit()
    while b[i]-a[j] > t or b[i] < a[j]:
        j += 1
        if j == len(a):
            print("no")
            quit()
    a.pop(j)
print("yes")
#D

#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission Info

Judge Result