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.

[[7, 12], [-173, 15, -64, -64, -10, 54], [87, 73, -93, -48, -75, -135]]
[12, 54, 87]

[[61, -35, -161], [-87, 73], [-82, 78, -19, -170], [-169, -132, 71], [-99, -136, -127], [88, -173, 0, 74, -8, 73], [-111, -164, -30]]
[61, 73, 78, 71, -99, 88, -30]

[[-136, -54, 82, -128, -200, -113], [-141, -10, 63, -160, -118, -89], [81, 66, -7, 5, -185], [-97, -143, 68, -114], [-142, -116], [27, -88], [-16, 15, 2, 42, -183, -149], [-47, -22, -115, -15, 67], [-198, 78, -177, -59]]

[82, 63, 81, 68, -116, 27, 42, 67, 78]