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, -118, 67, -7, -86, -200, 19], [33, -31], [64, -70, 80, -53, -103, 15, -1], [-198, -93, -116, -17, 93, -45], [67, -87, -139, 71], [-112, 30, -5, 71, -89, 96], [-101, -133], [-16, -177, -8, 27], [64, 44, -84, -176, -85]]