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.
[[-51, -1, -125, 45, 38, 0, -57], [-21, 67], [-5, -136, 48, 52, -39], [-157, -9, -112, -190, -52], [86, -16], [-170, -20, -57, 8], [98, 76], [36, -122, 61, -42, 51, -30, 57]]