Q-1. make smallest lexicographically string with given number of A,B and C count such that no three consecutive elements are same
Eg., A=1, B=3, C=0 -> babb
PS: Input will be given in such a way that answer will always exist