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, 79, -195, -49], [-104, 58, 65], [-160, -87, -144, -169, -98], [-82, 89, -192, -144, 62, 18], [-169, -22, -174, -2, -151, -122], [-95, -162, -13], [-32, -166, -37, -69, 20], [-184, -195]]
[79, 65, -87, 89, -2, -13, 20, -184]

[[-95, -68, -90, -106], [-7, -42, -177, 75, 14, -98, 19], [-10, -36], [6, 31, 55, -25, -19], [-20, -159, 89], [-70, 94, -66, -9, -34, -26, 51], [-12, 38, 23, 52, -196], [-103, 22, -32, -188, -4, -15, -108], [96, -125]]
[-68, 75, -10, 55, 89, 94, 52, 22, 96]

[[76, 70], [-158, -67, 71, -24, -177, -74], [34, -36], [-41, 97, -136], [11, -75, -94, -43], [77, -7, -123], [97, 25, -122, 98, -25, -143], [-33, 92, 26, -99, 38], [93, -99, 92, -5]]

[76, 71, 34, 97, 11, 77, 98, 92, 93]