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.
[[30, 14, 43, -115, -83, -191, -194], [-22, -37, -18, -109, -5, -63], [-104, -190, -90, -91, 15], [89, -145, -141, -66, 5], [-185, -5, -61, -11]]