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:
[[79, 50], [90, 81, -105]]
answer:
[79, 90]


question:
[[75, -154, -179, -44], [-46, 5, -27, -68, -112], [-200, 64, 56, -97, -109, -152, 96], [-129, -77, 58, -70], [29, 93, -138, -195, -141, 72, -181], [-133, -49, -200], [-5, -144, -95, -91, -99], [82, -69], [-195, -120, -86, -177, 30, 22, 92]]
answer:
[75, 5, 96, 58, 93, -49, -5, 82, 92]


question:
[[12, -65, -160, -132, -183, -3], [56, -1, -78], [58, 6, -42, -109]]
answer:

[12, 56, 58]