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:
[[-103, -43, 55, 15, -19], [21, -7, -107, -40, -189], [-111, 75, 73, -198, -190], [-135, 82, -144, -32, 84, -98]]
answer:
[55, 21, 75, 84]


question:
[[-191, 34, -39, -8, 47, 13], [-94, -33, -196, -199, 28, -149, 58], [35, 97, 98, 95, -133, 99, -101], [-190, -57], [-138, -149, 1, -168, 92, -195, 3], [-77, -100], [-130, 2, 30], [0, -177], [-38, -131]]
answer:
[47, 58, 99, -57, 92, -77, 30, 0, -38]


question:
[[1, -2, 40, 50, -4, 87, -13], [17, -89, -161, 37, 11, -194, -61], [73, -50, -99, -45, -127, -134], [-142, -156, -177, -18, 99], [100, -23, 51], [-182, 41, -87, -96, -165, -168]]
answer:

[87, 37, 73, 99, 100, 41]