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: [[-107, -152, -105, -113], [49, 56, 97, 94, -30, -19], [-56, 59, -97, -152, -86], [80, -119, -150, -199, -81, 22, -141], [-97, -110, -47], [-51, -65, -55], [-51, 9, -111, -14, -103, -59, -159], [-7, 64, 49, 70, -25, -49, -133], [-166, -40, -191, 81, 41]]
Example Output: [-105, 97, 59, 80, -47, -51, 9, 70, 81]

Example Input: [[-23, 34], [-9, -35, 39, -132, -43], [-195, 62, -128, -159, 62, -122, -109], [-98, 66, 28], [-48, 38], [-85, -91, -181, -129], [-125, -140, -162, -66, -2], [-196, -53, -117]]
Example Output: [34, 39, 62, 66, 38, -85, -2, -53]

Example Input: [[99, -105, 31, -88, -64, -29, -136], [-50, -113, -102, 25, -16], [-122, -60, 93]]
Example Output:
[99, 25, 93]