As you work through the forward pass on your network diagram, key each activity's earliest start plus duration into the calculator and store the result with M+ before moving to the next node, so you always have the previous node's earliest finish on hand. On the backward pass, do the same in reverse, subtracting duration from the smallest late start time among an activity's successors.