1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
import sys
sys.setrecursionlimit(15000)

def solution(info, query):
    aa = []
    bb = []
    for i in range(len(query)):
        aa.append(query[i].split('and'))

    for i in range(len(info)):
        bb.append(info[i].split(' '))

    for i in range(len(query)):
        b = aa[i][3].split(' ')
        aa[i][3] = b[1]
        aa[i].append(b[2])
        for j in range(5) :
            aa[i][j] = aa[i][j].strip()
            if aa[i][j] == '-':
                aa[i][j] = aa[i][j].replace('-',' ')
    result = []

    for i in range(len(query)):
        x = 0
        for k in range(len(info)):
            if aa[i][0] in info[k]  and aa[i][1] in info[k]  and aa[i][2] in info[k]  and aa[i][3] in info[k] and (int(bb[k][4]) >= int(aa[i][4])):
                x += 1
        result.append(x)


    return result