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.

[[-163, -60, 37, -195, -36, 3], [-32, 75, -1]]
[37, 75]

[[-18, -69, 27, -166, -146, -169], [-11, -183, -102, -104, -33, 65, -19], [-27, -147], [-41, -126, -9, -125], [-28, -26], [-33, -92]]
[27, 65, -27, -9, -26, -33]

[[-126, 39, 24, -108, -54, -168], [-39, -141, -85, -36], [-195, -122, -18], [-21, -141, -102, 59, 42, 3], [-199, 68, 1], [-165, -56, 58, -39, -10, -14], [-12, 55, -21, -50, -178], [21, -84], [65, -147, 73, -155, -12, -43]]

[39, -36, -18, 59, 68, 58, 55, 21, 73]