Consider the following variant of the Bellman-Ford algorithm

and the following weighted directed graph

Let S be the source node for the execution of the Bellman-Ford algorithm. If the edges are relaxed in the following order (S, A), (B, C), (S, D), (S, B), (D, C), (E, D), (A, B), (S, E), what is the distance estimate of node C after two iterations of the outer loop of the algorithm are finished? Just type the numerical answer.