const int k1; // time bound
const int k2; // time bound

// each player wants to maximise the expected number of messages sent in k steps
// (with players 2 and 3 forming a coalition)
<<p1:p2,p3>>max=? (R{"r1"}[C<=k1] + R{"r23"}[C<=k2])