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.

[[-26, 27, -21, 89, 86, -164], [96, -168], [-189, -188, -69], [-14, -14, -126, 40, -65], [52, -23, -149, 17, 90], [-171, -190, 75, 40, -187, 35], [-108, 99], [-81, 98, -137, 59], [4, -13, -66, -24, 41, -68, -147]]
[89, 96, -69, 40, 90, 75, 99, 98, 41]

[[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]

[[-112, -134], [-62, 94, -44, 95, -194, 42, 67], [28, 73, 6, -94, 78, -23, 72], [66, -43], [-115, -70, 55, 58, -118, -152], [-193, 0, -23, -126, 2], [-176, -131, -135, 72, 6], [-47, -7, -70, -1, -74, -141]]

[-112, 95, 78, 66, 58, 2, 72, -1]