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.

[[71, -129, -179, -116], [-38, 71, -114, -9], [-38, -148, -160], [-157, -176, -97, 60], [-183, -142, 7, -162], [97, -20, -160, -105, -98], [-98, 76]]
[71, 71, -38, 60, 7, 97, 76]

[[-20, -187], [-50, -191], [-69, -155, -10, -152, -72, 86], [53, -172, -84, 95]]
[-20, -50, 86, 95]

[[-24, 92, -135, -45, -58, 69], [-171, -28], [-40, -44, 82, 82, 98], [-153, -155, -64, 72, -59, -39, -25], [-167, -30, -48, 23, 4, -6]]

[92, -28, 98, 72, 23]