An (m,n) comb is a polyomino composed of a straight 2m-1 row of unit squares with m 'teeth' of length n. For example here's a (3,4) comb:

XXXXX
X
XXXXX
X
XXXXX

m must be at least 2 and n must be at least 1.

Can any set of various combs tile a rectangle? Provide an example or prove impossible.

How about a rectangle with one square removed?