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.

[[-49, 17], [-191, -6, -103, 85, -156, -163], [17, 20], [70, 50, -41, 39, -122, -66, -156], [-66, 12, 12, -1], [73, -75, -105, -96, -153, 3, -153], [72, -56, 76, 90, 33, 3, -145], [-9, 52, -65, -100, 59, -41], [-76, 58]]
[17, 85, 20, 70, 12, 73, 90, 59, 58]

[[89, 48, 81, 67, 22, 14], [-78, 84]]
[89, 84]

[[56, -13, -33, -25], [-188, 96, -142, -1, -181], [-145, -144], [-15, -179, -90], [-92, 46, -12, -23, -37], [-67, -190, -46], [-177, 8, -155, -76], [1, -134, -123, -134]]

[56, 96, -144, -15, 46, -46, 8, 1]