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.

[[38, -34, 24, 52, -11, 5], [-79, -185, 72, -181, 76], [-87, 25, 70, -182], [-10, 93, -144], [-96, -18, -23, 26, -100], [-79, 41, 99, -121, -68, -11], [-133, -37, -58, 12, -84, -79], [93, 94, -160, -81, -128, -122, -42]]
[52, 76, 70, 93, 26, 99, 12, 94]

[[-183, 42, 41, 27, -157], [-49, -170, -103, -128], [94, -192], [42, 89], [-73, -107, -134], [5, -23, -9, 4, -151], [-96, -41, -85, -120], [-82, -74, -32, 89]]
[42, -49, 94, 89, -73, 5, -41, 89]

[[-55, -189], [-2, 22, 78, -199], [-89, 18], [-3, -47, -21], [69, -6, 5, -89, 99], [44, -170, -3, 67, -90, -71, 57]]

[-55, 78, 18, -3, 99, 67]