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.

[[-150, 25, -177, 29, 1], [85, 82, -6, -151, -93, -182], [-181, 99, 32, 16, -116, 89], [-29, -186, -40, -7, -64, -29, -33], [-27, -68, -126], [-77, -3, -144]]
[29, 85, 99, -7, -27, -3]

[[-184, -93, -128, -153], [50, -104], [21, -156, -185, 27, 32, -187, -132]]
[-93, 50, 32]

[[-193, -46, -170, -80, -28, 2], [-86, -26, -56, -166, 77, -117, -171], [-188, -142, -181, -9, -117, 83, -88], [46, -86, -23], [-48, 56, -135, 8, -21], [19, -117, -9, 13, -118, -111, -113], [-123, -98, 64]]

[2, 77, 83, 46, 56, 19, 64]