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.

[[-153, 77, 64, -116, -130], [-176, -137, -198], [22, -14, -129, 76, -76], [-15, -37, 92, -141, -51], [13, 89, -191, -24, -197], [-11, 30, -51, 61, 26, 7, -105], [-126, -126], [-178, -132, 98, -22, 77], [7, -190, 60, -51, 62]]
[77, -137, 76, 92, 89, 61, -126, 98, 62]

[[-110, -23, -169, 17, -26], [-173, -98, 69, 24], [-57, 55, 60, 96, -31, -136], [-68, -152, -107, 74, 75], [-122, 20, -98, 36, -48, -92], [-178, -151]]
[17, 69, 96, 75, 36, -151]

[[-20, 74, -95, -81, -13, -48], [-176, -24], [-185, -9, -31], [-84, -136, -112, -68, -106], [-89, -181], [-74, 72, 100, 100, -109, -6, 70], [-177, -131], [75, -37, -59], [-25, 34, 17]]

[74, -24, -9, -68, -89, 100, -131, 75, 34]