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.

[[-95, 0, -192, 42, -97, -175, 46], [-35, -75, 40, 81], [8, 80, -20, -159, -36, -128, 96], [3, -193], [-35, -13, -69, -2], [11, 89, -183, -49], [-67, -184], [-164, -183, -107, 77]]
[46, 81, 96, 3, -2, 89, -67, 77]

[[-187, -179, -53, 29, -130], [45, -50, -46, -23, 82], [12, -82, 28, -108, 24, -77, -51], [2, -181, 87, -1]]
[29, 82, 28, 87]

[[-176, -143, 71], [44, -118, 45, -124, -149, -188, 86], [67, 77, 61, 2], [65, -112, 3, -176], [-29, 74], [27, -58, -114, -10, -80], [24, 39, -60, 92]]

[71, 86, 77, 65, 74, 27, 92]