Fewest deletions so a list's first k items avoid another list

You get two lists, a and b, and an integer k. Delete elements from b so that none of the first k elements of what remains also appears in a. Return the fewest deletions needed (or the resulting list), and say what happens when b runs out of elements.