Consider the following relational schema $R(ABCDEFG)$ with $FD$ set $\{AB → C, BC → A, AC → B, B → D, D → E\}$. The minimum relations required to decompose $R$ into $BCNF$ which satisfy lossless join and dependency preserving decomposition is ________.