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.

[[-20, -163, -126, -26], [-7, -183], [1, 84, 39, -79, -79, -98], [13, 2, -5, 20, 98, 30, -4]]
[-20, -7, 84, 98]

[[92, 72, -149, -138, -138, -155, -174], [50, -85, -69, -41], [-48, -72, -116, -197], [70, -140, -34, -178], [1, 50, -175, 18], [-127, -73, -45, -68, 30, -175, -65], [-53, -178, 6, 14, -158, -176, -112], [7, -183], [62, -91, 38, -46, -126]]
[92, 50, -48, 70, 50, 30, 14, 7, 62]

[[-20, -138, 4, -104, 39], [-163, 43, 75], [9, -25, -73, -40, -189, -40, -170], [0, -162], [-67, -6, -114], [-60, -187, -34, 90], [-64, 85, 95, 46, -197]]

[39, 75, 9, 0, -6, 90, 95]