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:
[[-100, -195, -66], [-6, -45, -30, -34, -43], [91, -127, -170, 11], [-127, 69, -126, -88], [-195, -24, -70, -91], [72, -1, -139, -122, -189]]

Ex Output:
[-66, -6, 91, 69, -24, 72]


Ex Input:
[[-200, -120, -174, -82, -148, -12], [-40, 8], [76, 24, 48, -1, -89, -107], [96, -88, -195, 58, -136, 17], [-176, -36, -147, -183, -86, -70]]

Ex Output:
[-12, 8, 76, 96, -36]


Ex Input:
[[-33, -6, -155, -129, 10, -143, -96], [-38, -67, -193, -121, -156]]

Ex Output:

[10, -38]