  We study Schroder paths drawn in a (m,n) rectangle, for any positive integers
m and n. We get explicit enumeration formulas, closely linked to those for the
corresponding (m,n)-Dyck paths. Moreover we study a Schroder version of
(m,n)-parking functions, and associated (q,t)-analogs.
