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.

[[97, -135, -83, -157, 30], [-24, 59, 42, -84, 64, -74], [6, 50, -174], [-170, 93, -66, -136]]
[97, 64, 50, 93]

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

[[-69, -30], [-19, -101, -6, -109], [52, -169, -97, -190, -157], [-133, -84, -132], [-18, -19, 30, -80, -97, 89], [-48, -44, 32], [-184, 13, -2, 97], [-94, 22, -188, -194, -109, -107]]

[-30, -6, 52, -84, 89, 32, 97, 22]