相信聪明的你一定能看懂的~ 玩什么原神啊，快来玩蔚蓝档案~

def check(m,l,r,j):
    for i in range(m):
        if not l[i]<=j[i]<=r[i]:return False
    return True 
for _ in range(int(input())):
    s=input()
    m=int(input())
    l=input()
    r=input()
    flag=False
    for j in range(int(l),int(r)+1):
        ss=str(j)
        flag=False
        if not check(m,l,r,ss):continue
        t=0
        for k in range(len(ss)):
            if ss[k] in s[t:]:
                t=s.index(ss[k],t)+1
            else:
                print('YES')
                flag=True
                break
        if flag==True:break
    if flag==False:print('NO')