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:
[[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]
answer:
[82, -53, 34, 100, 65, 57, 65, 58, -101]


question:
[[38, 7, -17, -108, -56, 8], [-165, 25, -30, -191, -19, -95], [-7, -124, -23, -13], [-83, -144, -95, -92, -2, 1, -73], [5, -111, 30, -128, 40, 2, 5], [59, -103, -28, 92, -106], [-180, 68, -149, 87, -159, -12], [-14, 76], [-95, -128]]
answer:
[38, 25, -7, 1, 40, 92, 87, 76, -95]


question:
[[9, -147], [-79, -4, 13, -71, -85, -58], [-169, -59, -195, -130, -88]]
answer:

[9, 13, -59]