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:
[[-9, -162, -58, -49, -137, 75, -173], [34, -149, -90, 9, -162, -82, -117], [81, -33, 96, 3], [33, -86, -48, 20], [-13, -67, 21, -39, -161], [-91, 50], [17, -2]]
answer:
[75, 34, 96, 33, 21, 50, 17]


question:
[[51, 10, -181, -96], [-40, 69, 46, -116, 53], [-135, 92], [-151, 35, -65, 52], [23, -125, 82, 57, -57], [-185, -94, -73, -131, -191, 70, -154], [9, 65, 41]]
answer:
[51, 69, 92, 52, 82, 70, 65]


question:
[[-46, -187, -163], [-32, -148, -39], [-187, -36, 52], [-19, -167, -22, -70, -135, -78, -44], [11, -122, -181, 4, 20, -61, 38], [-26, -73, -44], [29, 87, 68, 15, -29], [-147, -70, -106, 90], [-16, -100, 30, 74, -65]]
answer:

[-46, -32, 52, -19, 38, -26, 87, 90, 74]