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:
[[-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:
[[-43, 91, -9], [-92, -49, -69, -88, -200], [89, -39, -15, 43], [-52, 83], [39, -91, -113, 92], [-106, -91, -112, -149]]
answer:
[91, -49, 89, 83, 92, -91]


question:
[[-100, 17, 93, -79, 68, -43, -123], [-10, -102, 28, 46, -66], [-59, -152, 36, -34], [89, -61, -129, -176], [-178, 1, 11]]
answer:

[93, 46, 36, 89, 11]