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.

Example Input: [[53, -158, -69, 79, -98, -187, 65], [0, -152], [-171, -149, -71, -181, -72, -155], [32, 31, -153], [78, 34, -148, -1, 98, -69], [-157, 26, -9, -200], [-147, 20], [-85, 70, 35, -84, 25, -58]]
Example Output: [79, 0, -71, 32, 98, 26, 20, 70]

Example Input: [[5, -85, -188], [44, -175, 17, 82, 16], [-91, -101], [-172, -71, -147], [-90, 46, -27, 25, -122], [-23, -83], [-70, -18, 68, -98, -130, -177, -131]]
Example Output: [5, 82, -91, -71, 46, -23, 68]

Example Input: [[51, -63, -131, -155, -184, 24, -158], [-30, 12, 98, 69, 53], [77, -6, 31, -116, 41, -153, -190], [-22, 1, -7, -106, -70, 42, -103], [-129, -31, -180, 34, -16, -144, -195], [-191, -195, 93, 35, 64, -120, 76], [30, -200, -97, 23, 63, -197, -44], [-59, -40, 46, -84, 16], [-106, 97, 0, -89, -13]]
Example Output:
[51, 98, 77, 42, 34, 93, 63, 46, 97]