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:
[[84, -51, -87, 46], [-166, -93, -6, 1], [-128, -26, 26, 35, -48], [-198, -78, -151], [24, -176, -142, -169, -21, -44], [7, -142, -118, 87, 66, -29, -121]]
answer:
[84, 1, 35, -78, 24, 87]


question:
[[-91, 65, -182, -89, -129, 10, 64], [-65, 7, 2, 67, -160], [-176, -15, -177, 98, -49, -7], [-138, 46, -133, -190, -46, -187, 47], [76, 14, 42, -105, -142, -54], [-168, -16, -105, -95], [-148, 44, -18, 91, 23, -38], [56, 64, -189, -50]]
answer:
[65, 67, 98, 47, 76, -16, 91, 64]


question:
[[4, 25], [-42, -53], [-189, 44, -95, 66, -9, -164], [1, -197, 31, 96, -164, -25, -164], [58, -65, -64, -106], [-119, -46], [41, -25, 2, -104], [-128, -18, -79]]
answer:

[25, -42, 66, 96, 58, -46, 41, -18]