so in our example that we showed before we had the a1b1c1 assigned as the map assignment and we saw that the a1b1 was the maximizing assignment in clique1 and b1c1 was the maximizing assignment at clique2 and we also saw that due to the calibration property the choices of all of these cliques must agree which means it doesn't really matter whether we picked the value of b from this clique or that clique because they are going to give us exactly the same answer.