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.

Ex Input:
[[-50, 43, 3], [53, -199, 72, -60], [-135, 10, -186, -112], [92, -118, 88, -13, -183, -152, -20], [-173, -114, 85, -130, -153], [-186, -104], [-153, -52, -33, 41, -117, 16, -188], [-77, -47, -26, 19, -93]]

Ex Output:
[43, 72, 10, 92, 85, -104, 41, 19]


Ex Input:
[[-59, -69, -103, -115], [-110, 77, 55, 76, 78, 58, 40], [25, -90, -121], [-23, 81, 48, -18, 8, 94, 30], [-38, 78, 31, -125, -16, -129, 91]]

Ex Output:
[-59, 78, 25, 94, 91]


Ex Input:
[[-45, 53, 78, 27, 41], [-113, -109], [-69, -61, 5, -16], [-158, 66, -44], [-19, -43], [-109, -57], [-167, -105, -20, 90, -79, 32, 76], [-164, -143]]

Ex Output:

[78, -109, 5, 66, -19, -57, 90, -143]