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.

[[-146, 85], [5, -48, 82, -15, 0, 49], [-179, -123, 95, -154, -193, 2], [-111, -162], [-188, -25, 24], [-112, -147, -165], [65, -191, -134], [-189, 65, 46, -119, -62, -96, -43], [16, 5]]
[85, 82, 95, -111, 24, -112, 65, 65, 16]

[[9, -188, -167, -47], [-72, -97, -152, -108, -49, -5], [-88, -84, 26, -11, -91, -46, 62], [-110, -35, -61, -141, -182], [52, 29, 92, -131, -121, -98, -35], [-30, -125, -175, -123, -45], [91, -16, -57]]
[9, -5, 62, -35, 92, -30, 91]

[[-195, -160, -148, -160, -106], [81, -32, -72, -74, 44, -71, -26], [82, -115, -155], [61, -172, -114], [99, -26, 19, 42, -145], [-200, 83, 46], [-149, 21, -141, -119, -95], [-26, -83, -161]]

[-106, 81, 82, 61, 99, 83, 21, -26]