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:
[[-161, -49, -6], [36, -84], [-53, 29, 2, -167, -111], [-163, -46], [-41, -91], [-71, 29, 35, -187, -53, -196, -66]]
answer:
[-6, 36, 29, -46, -41, 35]


question:
[[-187, -52, -138, 33], [-32, -176, -198, -74, 66], [95, -187, 82, -51, -114]]
answer:
[33, 66, 95]


question:
[[21, -155, 40, -15, 28], [30, -165], [69, -9, 29, -167], [100, -92], [-28, 87], [-173, -195, -75, 76, -130], [2, -73, 33, -68], [-80, -154, -109, 55], [93, 52, -147, -118, -121, -75, -158]]
answer:

[40, 30, 69, 100, 87, 76, 33, 55, 93]