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:
[[-160, -157, 75, 3, -119, 14, -70], [-156, 70, 10, 21], [-86, 47], [-52, 80, 87, 26, -100, 48], [-36, -127, 37, -1, -59, -26, 8], [72, 48], [-200, -178, -142, -12], [-5, -61], [76, -54, -134]]
answer:
[75, 70, 47, 87, 37, 72, -12, -5, 76]


question:
[[-186, -87, -112, -3], [-180, 50, -4, 45], [-89, -128, -195, -38], [51, -28, -10, -48], [-191, 10, -146, -98, 42, -64, 22], [-151, 54, -57], [-58, -90, 81, -35, -25, -172], [-155, -65, 76, -93]]
answer:
[-3, 50, -38, 51, 42, 54, 81, 76]


question:
[[55, -26, -162, -58, -176, -121], [-45, 0], [-31, -198, 14], [40, -195, -172, 43, -131, -22], [-198, 80, 10, 7], [-82, 94, 49, -115, -183], [-30, 15, -79, -39, 24], [-20, 19, -87, 57]]
answer:

[55, 0, 14, 43, 80, 94, 24, 57]