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: [[0, -183, -46, -46, -108], [-131, -150], [-93, 75, 9, 47, -33, 54, 16], [-77, -63, 29, 100, -186, -95, -84], [-115, -140, 73, -191, -117, 90], [-165, 95, 31, -180, -104, -180], [-173, -24], [13, -54, -180, -25, -46, -42], [-96, -133, 10, -61, -74]]
Example Output: [0, -131, 75, 100, 90, 95, -24, 13, 10]

Example Input: [[-143, 33, -146], [-82, -145, -105, -21], [0, -95, -164], [-153, 9, 51, 84, 71, -82], [5, 73, 67, -153, 11, -136], [-1, 81, -75, -41], [-102, -43, 69, -150]]
Example Output: [33, -21, 0, 84, 73, 81, 69]

Example Input: [[-181, -193, -177, -37, 86, -146, -134], [-105, 90, -58, 18], [-151, -143], [-143, 64, 52, -32, -153, -177], [-143, -10, -158, 16, -135, -30], [-12, -38, 98, -50, -9], [-21, 24, -126]]
Example Output:
[86, 90, -143, 64, 16, 98, 24]