图书管理员

def solve(nq, books_data, queries_data):
    n, q = map(int, str(nq).split())
    books = str(books_data).strip().split(',')
    queries = str(queries_data).strip().split(',')
    for query in queries[:q]:
        query = query.strip()
        qlen = len(query)
        found = [b for b in books if len(b) >= qlen and b[-qlen:] == query]
        print(' '.join(found) if found else 'Not Found')