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:
[[-198, -161], [66, 7, 92, 36, -103, -44], [-121, 33, 33, -183, 81, -87, 6], [-125, 1, -186]]
answer:
[-161, 92, 81, 1]


question:
[[-26, 27, -21, 89, 86, -164], [96, -168], [-189, -188, -69], [-14, -14, -126, 40, -65], [52, -23, -149, 17, 90], [-171, -190, 75, 40, -187, 35], [-108, 99], [-81, 98, -137, 59], [4, -13, -66, -24, 41, -68, -147]]
answer:
[89, 96, -69, 40, 90, 75, 99, 98, 41]


question:
[[-158, -8, 24, -130, -41, -106, 64], [-187, -105, -76], [-169, -65, -181, 33, -165], [-103, -110, 16, -151, -48, -147, -165], [-109, 23, -52, -146, -101], [-140, 0], [-112, -194, -109, -89]]
answer:

[64, -76, 33, 16, 23, 0, -89]