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.
[[22, -189, -48, 47, 15, -52], [-37, -4, -132, -85, -50], [-156, -71, -108, -72, 90], [-194, -64, -2], [-19, -127, 27, -25, -1], [18, -104, -188, -112, -5, 53, -132], [-78, 19, -191], [-47, -150, 90, -19, -29, 52, -181]]