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:
[[-144, -147, -167, -134], [-136, -155, -95, 11, 3], [21, -157, -154, -85, -48, -42], [-22, 20, 86, 45], [-121, -74], [18, -1, -80, -98], [-96, -192, -106, 81, -44, -157], [92, -40], [79, -82, -172, -123, -164, -67, 46]]

Ex Output:
[-134, 11, 21, 86, -74, 18, 81, 92, 79]


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

Ex Output:
[0, -131, 75, 100, 90, 95, -24, 13, 10]


Ex Input:
[[30, -53, 43, 24, -75], [67, 12], [-41, -21, -10, -28, -151], [-146, -73, 14, -45, 41, -114], [-121, 77, -104, -42, 54, -21], [-138, -93, -97, -189], [34, -34, -95, -119, -130], [-2, -77]]

Ex Output:

[43, 67, -10, 41, 77, -93, 34, -2]