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:
[[97, -135, -83, -157, 30], [-24, 59, 42, -84, 64, -74], [6, 50, -174], [-170, 93, -66, -136]]

Ex Output:
[97, 64, 50, 93]


Ex Input:
[[2, -34, -18, 14, -118], [-83, -168, -91, -189, -43, -84], [-3, -67], [-99, -66, -24, -133, 4, 14], [56, -148], [-148, 61, -10], [-105, -19, -19, -23], [-11, 97, -151, -180, -160], [-74, -14, -67, -75, -111]]

Ex Output:
[14, -43, -3, 14, 56, 61, -19, 97, -14]


Ex Input:
[[50, -106, 74, -29, -57, -18, 88], [-165, -44, -83, 23, -133, -10], [70, -144, -172], [-113, -130, -17], [-103, 94, 60, -40, -190, -59], [-114, 32, -10], [-190, 54, 44, -56, -60, -31], [9, 42, -148, -9, -133, -158, -45], [-18, 36, 78, -79, -177, -136]]

Ex Output:

[88, 23, 70, -17, 94, 32, 54, 42, 78]