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.

[[-50, -43], [8, -108, 3, 41, 100, -103], [-171, 61, -67, -75, -58, 47], [0, 82, -166, -101, 66], [-65, -87, -28, -194], [42, -162, 15, 39, -11, -126]]
[-43, 100, 61, 82, -28, 42]

[[-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]]
[-16, 68, 80, -85, -15, 94, 69]

[[-64, 53, -189], [57, 21, 53, 72, -133, 95], [-108, -120, -151, -112, 47, -140, 19], [-16, -156, -43, -45], [-186, -137], [91, -65, -194], [33, 15, -179]]

[53, 95, 47, -16, -137, 91, 33]