void abort() { };

                                                                       
                                                  
                                                                             
                                                                   
                                                  
                                                                             
                                                                              
                                                                             

                                                                                                                                                               
                        
void assume_abort_if_not(int cond) {
  if(!cond) {abort();}
}
/*@ 
    requires ((1 <= cond)) && (cond != 0);
    ensures (((1 <= cond) && (__BLAST_NONDET == \old(__BLAST_NONDET)))) && (1);
@*/
void __VERIFIER_assert(int cond) {
  if (!(cond)) {
    ERROR: {/*@ assert(0); */;abort();}
  }
  return;
}
int __VERIFIER_nondet_int();
int __BLAST_NONDET;
/*@ 
    requires (1);
    ensures ((__BLAST_NONDET == \old(__BLAST_NONDET)));
@*/
int main() {
    int i,j,k,n,l,m;
    n = __VERIFIER_nondet_int();
    m = __VERIFIER_nondet_int();
    l = __VERIFIER_nondet_int();
    if (!(-1000000 < n && n < 1000000)) return 0;
    if (!(-1000000 < m && m < 1000000)) return 0;
    if (!(-1000000 < l && l < 1000000)) return 0;
    if(3*n<=m+l); else goto END;
/*@
loop invariant ((((((i <= ((long long) n + 1)) && (2 <= n)) && (1 <= i)) || ((i == 1) && (0 <= n))) || (i == 0)));
@*/
    for (i=0;i<n;i++)
/*@
loop invariant ((((((((long long) i + 1) <= n) && (j <= ((i + ((long long) n * 2)) + 1))) && (((long long) i * 2) <= j)) && (1 <= i)) || (((1 <= n) && (j == 0)) && (i == 0))));
@*/
        for (j = 2*i;j<3*i;j++)
/*@
loop invariant (((((((long long) i + 1) <= n) && (((long long) j + 1) <= ((long long) i * 3))) && (k <= (i + ((long long) n * 2)))) && (((long long) i * 2) <= j)));
@*/
            for (k = i; k< j; k++)
                __VERIFIER_assert( k-i <= 2*n );
END:
    return 0;
}