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.

[[-109, -49, -71, -4], [37, 18, -37, -47, 21, 0, -43], [90, -154], [33, 60, -7, -153], [-46, 9, 52, -84, 30, 55], [53, 14], [83, 72, 56, -46]]
[-4, 37, 90, 60, 55, 53, 83]

[[89, -123], [-133, -92, -92, -101, 47], [19, 8, -116, -70], [-97, -36, -123]]
[89, 47, 19, -36]

[[96, -158, 71, 97, -199, 34], [41, -7, 27, 7], [-78, -125, -47, -186, -21, -76, -65], [-170, 98, 63], [87, 73], [80, 99, -95, -51], [-48, 14, 68, -89, -177, -154, -170]]

[97, 41, -21, 98, 87, 99, 68]