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.

[[-110, -173], [12, 37, -136, -70, -108], [-114, 0, -48, -74], [24, -48, -112, -166, -21, -28]]
[-110, 37, 0, 24]

[[-122, -18], [-126, -168, -62], [-185, 20, -166, 59, -185, -181, -174], [-32, -105, 14, -182], [91, 95], [-12, -124, 4, -192, -101, -200, -69], [-49, -113, 94, 50], [23, -25], [92, -139, -21, -136]]
[-18, -62, 59, 14, 95, 4, 94, 23, 92]

[[-39, 78, -40, -61, -188, 70], [-76, -7, 49, -174, -118, -42, -59]]

[78, 49]