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.

[[-6, 83, -124, 9, -190, 76, -8], [48, -10, -88, -125], [5, -33, -85, 83, 31, 4, -125], [53, -95, 41], [-28, -75, -55, 35], [-103, -190]]
[83, 48, 83, 53, 35, -103]

[[-15, -180, -24], [-18, -77], [-167, -37, -37], [97, 80], [-91, 18, -122, -8, 90, -125, -162], [96, 74, -57, 89, -171], [66, -113]]
[-15, -18, -37, 97, 90, 96, 66]

[[93, -22, -9, 97, 4], [40, -10, 93, -28, -40], [50, 16, -128, -110, 48], [-42, -90, -138, 9, -1, 68], [-27, -91, 28], [-47, -166], [-56, 85, -32, -54, -132, 36], [75, 69, 46, -139, 96, -133], [-19, -162, 83, 43, -150, -123]]

[97, 93, 50, 68, 28, -47, 85, 96, 83]