1*5971e316Smrg for (int c0 = p; c0 <= min(m - 1, q); c0 += 1) 2*5971e316Smrg S2(c0); 3*5971e316Smrg for (int c0 = m; c0 <= min(n, p - 1); c0 += 1) 4*5971e316Smrg S1(c0); 5*5971e316Smrg for (int c0 = max(m, p); c0 <= min(n, q); c0 += 1) { 6*5971e316Smrg S1(c0); 7*5971e316Smrg S2(c0); 8*5971e316Smrg } 9*5971e316Smrg for (int c0 = max(max(m, n + 1), p); c0 <= q; c0 += 1) 10*5971e316Smrg S2(c0); 11*5971e316Smrg for (int c0 = max(max(m, p), q + 1); c0 <= n; c0 += 1) 12*5971e316Smrg S1(c0); 13