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]

[[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]
[55, 64, 56, -31, -4, 51]

[[62, 68, 15, -89, -43], [-126, 96, -109, 54], [90, -170, 13, -11, -16, -49], [-77, -144, -87, 92, -29, -117], [-182, -94, -126, -158, 4, -43, -87], [-150, -99, -51, 5, -197, -16, 11], [-160, -94], [-160, -13, 5, -183, -41, 65], [-137, -94, -30]]

[68, 96, 90, 92, 4, 11, -94, 65, -30]