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.

[[31, 44], [13, -22, 72, 55, -34], [-27, 78, 59, 91, -145], [14, -162, -184, -161, -77, -168, -99], [-136, 28, 56, -45, 85], [-29, -101, 59, 6, 99, -113], [81, 42, -55]]
[44, 72, 91, 14, 85, 99, 81]

[[-35, -168], [73, -23, -44, -109], [-90, 58, -47, 56], [-27, -102, -149, -183, 72]]
[-35, 73, 58, 72]

[[91, -183, -181, -101, 77, -154], [-194, 49], [50, -129, -49, -176, 26, -164, -145], [-154, -172, -140, 60, -36, -138], [-56, 92, 99, -15, -174], [81, 11, -118, -60, 73, -105, 42], [-12, -55, -42, -89, 39, -179]]

[91, 49, 50, 60, 99, 81, 39]