Can the concatenation of two non-regular languages be regular?
Hint: Let $C$ be the language of words that have the same number of 1's as 0's.  Is $C$ regular?  Let $A = \{0,1\}^* \setminus C$.  Is $A$ regular?  Now, can you find a non-regular language $B$ that will make $AB$ regular?