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.

[[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]

[[-132, -99, 9, -38, -77], [-7, 12, -183], [-158, -194], [-166, -39], [-115, -89, -104, -80, -147], [73, -200], [51, -31], [-51, -166, 69, -131], [26, -61, 53]]
[9, 12, -158, -39, -80, 73, 51, 69, 53]

[[-162, -159, -77], [-147, -168, -165], [49, 33, -166, -35, -160], [-171, -149, 95, 48], [-39, -77, 62, -130], [-103, 77, 23, -95, 94, -197, -29], [51, -58, -64, -181, 9, -167]]

[-77, -147, 49, 95, 62, 94, 51]