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.

[[83, 58], [1, -44, 39, 96, -139], [-177, -38, -191, -176, -173], [74, -94, -36], [-117, 29, -68, -191, 50, -102], [-73, -137], [51, -72], [85, -159], [-130, -191, -111, -94, -124, -199, -26]]
[83, 96, -38, 74, 50, -73, 51, 85, -26]

[[77, 41, -119, -94, -64], [-129, 98], [57, -199, -120, 23, 55, -62], [-76, 55, -37, -164, 95, 75, -120], [-149, -121, -123, -133, -136, 68]]
[77, 98, 57, 95, 68]

[[-23, -9, -25, 34, -127, -36], [-192, -82, 58, 37, -8], [-15, 31, 11, -39, -106, -109], [-52, -109, -73, 85, -31, 84, -164], [-34, -23, -116, -87, -2, 83, -130], [-155, -129, -176, -77, -137, -133, -138], [-178, 29, -65, -164, -23, -141, 33], [-24, -63, -40, 12, -170, -111, -141]]

[34, 58, 31, 85, 83, -77, 33, 12]