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:
[[-176, 16, -88, 98, -44], [-156, -113, -11], [25, -32, -27, 98, -103, -77, -111], [8, -82, -157, 26, -176, -52, -180], [-77, -200, -183, -59, -143, 10]]
answer:
[98, -11, 98, 26, 10]


question:
[[-71, -181, 24], [-179, -158, -186, 56, -55, -86, 93], [61, -98, -126, -84], [-46, -23, 79, 66, -31, 22, 18]]
answer:
[24, 93, 61, 79]


question:
[[73, -149, -105, -2, 69, 31], [-141, -124], [-175, 60, -136, -65], [-51, -163, -69, 67, -47, -197], [-143, -43, -52, -58, 20], [-149, -4], [-1, -152]]
answer:

[73, -124, 60, 67, 20, -4, -1]