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.

[[-18, -29, 4, 70, -1, 66], [-63, -199], [-128, 88], [-80, -95, -40, 51, -97], [-55, -200, -186], [-103, -104, -9, -179, 93, -82, -129]]
[70, -63, 88, 51, -55, 93]

[[-106, -87, -48, -151, -158], [37, -16, -44, -111, -9, 24], [77, -42, 54, -105, -26, 78, 55], [-60, -1, -86, 94, -187, -90], [-163, -119], [79, -109, -183, -28], [23, 3, 43], [49, -109, -5, -47, -196], [7, -35, 95, -85, 99, -86, -22]]
[-48, 37, 78, 94, -119, 79, 43, 49, 99]

[[-140, -192, -17, -188, -102], [-79, 45]]

[-17, 45]