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:
[[-85, -197, 23, -152], [-86, 62, 72, -58, 33], [-117, 76], [-195, -177, -170, 97], [30, 79, -50, 72, 54], [-23, 49, -16, -188], [32, 5], [-109, -31]]

Ex Output:
[23, 72, 76, 97, 79, 49, 32, -31]


Ex Input:
[[-89, -107, -120, -129, -109, -16], [-66, -180, 68, 29, -113, -92], [-102, -113, -115, 80, -194], [-187, -134, -85, -174, -133], [-15, -124, -94, -186, -175, -54], [-95, -9, -56, -18, 94, -94, -56], [69, -24, 18, 17]]

Ex Output:
[-16, 68, 80, -85, -15, 94, 69]


Ex Input:
[[-155, -16, -158], [65, -195], [-77, -154, -112, 52, -7, 45, -136], [-146, -130, 3, 7, -179], [-151, -64, 23, -35, -168], [-22, -188, 48, -178], [-154, 92, 66, -117, -90, 39, 42]]

Ex Output:

[-16, 65, 52, 7, 23, 48, 92]