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:
[[-45, 100, 36, -80, 90], [-117, 80, -105, 86], [45, -168, -148, 87, -195, -102]]

Ex Output:
[100, 86, 87]


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:
[[-47, -58, -15, -164, 29, -118], [-120, -21, 91], [-88, -139, -142, -149, 99, 36], [-147, 59, -14, 34, -158, 81], [21, 91, -23], [-81, 50], [-24, 44]]

Ex Output:

[29, 91, 99, 81, 91, 50, 44]