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.

[[-178, 31, -89, -67, 55, -105], [-18, 92, -9, 69, -95, 92], [-95, 45], [-127, 57], [41, -37, 33, 41], [-72, -74, -86, -183, 86, 31], [35, -121, -199], [-165, -69, 85, -172], [14, 85, -46, -140, 25]]
[55, 92, 45, 57, 41, 86, 35, 85, 85]

[[21, -143, 100, -121, 53], [-196, 60, 71], [-71, 38, -90, -65, -98], [-76, -31, -114, 10, -102, -81, 11], [-132, -94, -171, -142, -1, -80, -90], [8, -113, 13], [-114, 79], [-142, -194, -116, -90, 30]]
[100, 71, 38, 11, -1, 13, 79, 30]

[[-132, 53, -122, -197], [-68, -167, -171, -145, -191, -168, -75], [-103, -139, -39, -54, -13], [-168, -138, 46, 20], [-147, 2], [34, -28, -59, 7, -143, -152], [3, 61, 25], [69, 0]]

[53, -68, -13, 46, 2, 34, 61, 69]