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.
[[63, 2, -10, 86, -171], [-10, 87, -130, -142, 56, 50, -27], [35, -145, -47, -72], [-73, -189, -113, 95], [-183, -6, 41, -88, 13, -153, -152], [-74, -15, 95, -167, 73], [-171, -38, 83, -147, -62], [-83, -51, -86, 67], [-36, 13, 7]]