our main contribution here is the discovery of a new family of standard tableaux $ {\cal t}^k_n $ which are in bijection with the family ${\cal d}_{m,n}$ of rational dyck paths for $m=k\times n\pm1$ (the so called ``fuss'' case). using this family we give a new proof of the invertibility of the sweep map in the fuss case by means of a very simple explicit algorithm. this is joint work with guoce xin.