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.

[[69, -92, -181, 13, 31, -185], [-14, -145, -116, 13, -132, 90, 0], [-188, -25, -182, -101, 14]]
[69, 90, 14]

[[79, -173, 27, 69, -53, -140, -166], [-198, -73, 95, 10], [82, -186, -168, -94, -6], [52, -73, 66, -106, 48, -37], [-78, -67, -36, -147, -18, -11]]
[79, 95, 82, 66, -11]

[[-3, -96, -48, -113], [92, -172, -51, -98], [-147, -12, 37, 49, 96, 74, -128], [-108, -31, 79, 64, -94, -151], [-10, 48, -25, 9], [90, -129, -111, -97, 83, -15, -72]]

[-3, 92, 96, 79, 48, 90]