We will review the necessary combinatorics of parking functions and related objects to understand the following new question posed by Nantel: Can we expand the shuffle ex-conjecture in terms of ribbon Schur functions? This question is related to the steep-bounce ex-conjecture.