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.

[[-170, -186, -15], [-130, -93, -50, 88, -170], [-15, -144, -141], [-85, -104, -115]]
[-15, 88, -15, -85]

[[-105, 91, -50, 93, -119, -108], [-190, -161, -97, -149, -13, 57], [-138, -124, -182, 20, -75, 98, -127], [-200, -188, -102, -171, -179, 60, 29], [-69, -87, 15, -52], [-177, -147, -64], [-147, -198, -141, -67, -9, -135, -106]]
[93, 57, 98, 60, 15, -64, -9]

[[-73, -157, -84, -57], [52, 85, 14, -164], [28, 94, -149], [22, -193], [2, -86, 24, -34, -194, 44, -159], [-121, -61, 36, 60, -57], [-190, -8, -186, -43, -9, -168, 97]]

[-57, 85, 94, 22, 44, 60, 97]