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.

[[-16, -54, -63, 93, -162, -89], [68, -135], [96, -48], [94, -86, 22, -98, -95, 31], [81, -15, -150, -108, -34, 29], [-17, 67, 71, 14]]
[93, 68, 96, 94, 81, 71]

[[18, -95, -165, -171, -117], [62, -61, -196, -59, 84], [-83, -159], [-11, -65, -188, -27, 96, 88, -70], [-136, -91, -52], [-6, -118, 90, -192], [-179, 36, 76]]
[18, 84, -83, 96, -52, 90, 76]

[[54, -13, 41, -120, -119, -57, 86], [34, -115, -51, -54, 54, 48], [-13, 60, -36], [-196, -47, 65, -146, 46, -174], [64, -62, -167], [36, 76, -94, -30, -148, -79, -137]]

[86, 54, 60, 65, 64, 76]