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:
[[-49, 17], [-191, -6, -103, 85, -156, -163], [17, 20], [70, 50, -41, 39, -122, -66, -156], [-66, 12, 12, -1], [73, -75, -105, -96, -153, 3, -153], [72, -56, 76, 90, 33, 3, -145], [-9, 52, -65, -100, 59, -41], [-76, 58]]
answer:
[17, 85, 20, 70, 12, 73, 90, 59, 58]


question:
[[-115, -177, 49, -176, -199], [2, 68, -35, 54, 43, -130]]
answer:
[49, 68]


question:
[[-82, -72, -196, -127], [-25, -96, -143, -138, 50], [-182, -14, 10, -145, -144, -152], [97, 3, -149, -92, -103, -199]]
answer:

[-72, 50, 10, 97]