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.

[[75, -168, -26, -170, -66, 46, -55], [-24, 95, -6], [-138, -147, 53, 1, -161, 70, -180], [7, 68, -48, -112, -121, -178, 44], [100, -87], [-95, -99, -2], [-90, -10, 15, -177, 6, -46], [-78, -99, -136, -41, 20, 32, -187], [-168, 97]]
[75, 95, 70, 68, 100, -2, 15, 32, 97]

[[-123, -135, -68], [-5, 30, -61, -105, -111], [70, 99, -198, 44, -10, 73], [-3, -54, 15, -79, -84, -4, -94]]
[-68, 30, 99, 15]

[[-156, -91, -191], [-194, -157, -40, -16], [-2, 53], [-123, 9, -182, -185], [-57, 100, 28, 77, -88, -170, -41]]

[-91, -16, 53, 9, 100]