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:
[[-191, 84, -188], [58, -44, -167, -105, 37], [-92, -44, 3, 23, 26, 37], [-107, -65, 55, 81], [-32, 58], [31, -25, -80, -152, -111, -154, -147], [-166, -135]]

Ex Output:
[84, 58, 37, 81, 58, 31, -135]


Ex Input:
[[-66, -108, -51, -41], [-113, 13], [-83, 43], [88, -114, 42, -103, -132, 68, 62], [-164, 15], [10, 32, -120, 32], [-132, -140, -73, 33], [-27, -174, 2, 57, -113]]

Ex Output:
[-41, 13, 43, 88, 15, 32, 33, 57]


Ex Input:
[[-88, -138, -135, -8, -8, -109], [59, 85, -108, -115, 22, -89], [-140, -22, 23, -128, 7, -195], [71, -9, -100, 49], [-159, -5, 35, -87, -194, -152], [62, -184, -71, 87, 8], [-182, -59, -86, 39, -18, -24, 26], [-85, 91, -192], [-30, 85, 64, -126, 75, -147]]

Ex Output:

[-8, 85, 23, 71, 35, 87, 39, 91, 85]