We give a combinatorial proof of a recent geometric result of Farkas and Lian on linear series on curves with prescribed incidence conditions. The result states that the expected number of degree-d morphisms from a general genus g, n-marked curve C to P r , sending the marked points on C to specified general points in P r , is equal to (r + 1) g for sufficiently large d. This computation may be rephrased as an intersection problem on Grassmannians, which has a natural combinatorial interpretation in terms of Young tableaux by the classical Littlewood-Richardson rule. We give a bijection, generalizing the well-known RSK correspondence, between the tableaux in question and the (r +1)-ary sequences of length g, and we explore our bijection's combinatorial properties.We also apply similar methods to give a combinatorial interpretation and proof of the fact that, in the modified setting in which r = 1 and several marked points map to the same point in P 1 , the number of morphisms is still 2 g for sufficiently large d.Definition 1.1. Define an L-tableau with parameters (g, r, d) to be a way of filling the boxes of an (r + 1) × (d − r) grid with rg "red" integers and (d − r)(r + 1) − rg "blue" integers such that: