instruction:
In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
question:
[[-61, 31, -135, 15, -167, 30], [-1, -18], [65, 41, -43, -165, -28, -135], [-15, -117], [-38, -151], [12, 59, -5, -79, -104, -109, -93], [-66, -61, -171, -23]]
answer:
[31, -1, 65, -15, -38, 59, -23]


question:
[[-32, -76, -121, -152], [-72, -164, -165], [-56, 43], [38, -76, 59]]
answer:
[-32, -72, 43, 59]


question:
[[-39, -154, -75, -56, 85, 20, -66], [-81, -92, -188, 97, -10], [-153, -164, -72, 52], [55, -96, -82], [-108, 46, -159, 46, -20]]
answer:

[85, 97, 52, 55, 46]