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, -63, -64, -183, 95, -144], [-60, 44, -72, 31, -170, 88], [-127, 4, 73, -124, -186], [59, -117, -13, -186], [9, 39], [-174, 92, 4, -67, -112], [78, -107], [48, -75, 13, -184, -140, -104]]
[97, 88, 73, 59, 39, 92, 78, 48]

[[-192, -183, 27, -64, -73, 59, -30], [-127, -95, 61, -80], [-129, -43, -148, 74]]
[59, 61, 74]

[[-141, 79, -56, 60, -87], [34, -88], [-139, -83], [-89, 61, -54, 90, 55, 37], [-198, -12, -162, -56, -61], [-81, -43, -93, -49, 24, 45], [19, -186, -105, -97, -187, 39, 69], [-70, -83, 94]]

[79, 34, -83, 90, -12, 45, 69, 94]