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.
[[-38, -51, -115, -1], [21, -101, -34, 53, 44], [-190, -145, -79, 9], [-142, 57, -177, -159], [5, -75, -66, -137, 66, -187, -194], [-21, -22, -32, -71, 82, -185], [30, 97, -169, -113]]