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:
[[-148, 81, -175, -45, -129, 21, -51], [-167, 84, -70], [-59, -144, -3, -78, -178, -5], [-3, 93, -92, -18, -119], [-41, -77, -99], [-159, -197, -151, 21, -3], [6, -160], [87, 7, -178], [-103, -100, -16, -46]]
answer:
[81, 84, -3, 93, -41, 21, 6, 87, -16]


question:
[[90, -119, -109], [-43, -4, -156, -53], [-76, -171, 18, -56, -146]]
answer:
[90, -4, 18]


question:
[[47, -54, 96, -169, 34], [-49, 67, -13], [93, 71, -92, -84, -83], [-138, -136, -108, -196, -158, -79, 12], [52, -7, 54, -188, -1, -53]]
answer:

[96, 67, 93, 12, 54]