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:
[[100, 3, -8, -15, -181, 25, -122], [-183, -120], [-95, -183, -94], [-34, -100, -172, 63, -139, -136], [-175, -113, -104, 50], [-170, -139], [-159, 80, 29, -100, -142, -108, -36], [56, -11], [-120, -109, -28, 88, -145, -92]]
answer:
[100, -120, -94, 63, 50, -139, 80, 56, 88]


question:
[[-176, 36, 94, 7, 55, 29], [-66, 24, -23, -199, -43, -40], [-99, -187, -132, -129, 12]]
answer:
[94, 24, 12]


question:
[[22, 35, -155, -147, -25, -105], [-10, -81], [-140, 96], [9, -106, -50, -199, -48, -1], [30, 50, -35, -196]]
answer:

[35, -10, 96, 9, 50]