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:
[[-153, 77, 64, -116, -130], [-176, -137, -198], [22, -14, -129, 76, -76], [-15, -37, 92, -141, -51], [13, 89, -191, -24, -197], [-11, 30, -51, 61, 26, 7, -105], [-126, -126], [-178, -132, 98, -22, 77], [7, -190, 60, -51, 62]]
answer:
[77, -137, 76, 92, 89, 61, -126, 98, 62]


question:
[[-150, 25, -177, 29, 1], [85, 82, -6, -151, -93, -182], [-181, 99, 32, 16, -116, 89], [-29, -186, -40, -7, -64, -29, -33], [-27, -68, -126], [-77, -3, -144]]
answer:
[29, 85, 99, -7, -27, -3]


question:
[[-167, -126, 15], [-159, -124, -137, -38]]
answer:

[15, -38]