in how many ways can we place anywhere from $0$ to $9$ indistinguishable checkers on a $3\times 3$ checkerboard (no more than one checker per square), such that no row or column contains exactly $1$ checker?