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.

[[-59, 44, -29], [-168, -64, -74, 51, -166], [-22, -130, -9, -67, -98, 46, -114]]
[44, 51, 46]

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

[[-29, -17, -18, -174, -146, -174], [-106, 72, -156, 66, -121, -30, 17], [44, -95, -155, -54, -185], [-89, -43], [-21, -167, -164, -103], [-10, 20, -144], [-175, -114, 15, -152, -104], [67, -12, 55]]

[-17, 72, 44, -43, -21, 20, 15, 67]