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.

[[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]
[58, 19, 68]

[[52, -128, -179, -149, 20, -143], [-174, -30, -84, -103, 39, -123, -85], [-52, 86, -77, 10, 58, -150, 95], [-165, -32, -190, -88, 2], [-21, -113, -67, -17, -39, -177], [-124, -40, 57], [73, -171, -187], [70, 37, 45, -160, -78], [-48, 44, -59, -75, -63, -77]]
[52, 39, 95, 2, -17, 57, 73, 70, 44]

[[-7, 44, -126, -96], [-48, -14], [-63, -137, 100], [15, 81, 83, -185, -103, -152, -8], [52, -82, -2, 30], [-161, -171, -113, -102, 9]]

[44, -14, 100, 83, 52, 9]