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:
[[36, 35], [-130, -104, -27, 40, 69, -115], [-26, 66, -66, 16], [-23, 79, 51, -13]]
answer:
[36, 69, 66, 79]


question:
[[-132, 51, -121], [-123, -194, -188, 49, 47, -33, -10], [86, -119, -59, 58, 74, -75, 77], [-65, -109, 66, -108, -51], [30, 74, -151, -11, -11, -30], [-151, -181], [-117, 32, 49, -173], [-176, -152, 25, -56, -15]]
answer:
[51, 49, 86, 66, 74, -151, 49, 25]


question:
[[-105, -77, -85, -10, 91, -88, -172], [-178, 22, 94, -87, 7], [82, -9, 80, -12], [-171, 60, -66, -190], [34, -55, -35], [10, -114, -142, -14], [26, -150, -39], [-89, -156, -155, -90], [30, 30]]
answer:

[91, 94, 82, 60, 34, 10, 26, -89, 30]