Some task

#include <stdio.h>

const int r = 9999;
long i[r],j[r];

long x,m,n,k,q,l,w;


int main() {

    l = 0;
    while (scanf("%li %li", &i[l], &j[l]) == 2) {


    if (i[l] > j[l]) {

    q = i[l] ;
    i[l] = j[l];
    j[l] = q;

    }

    l+=1;

    }

    for (w = 0;w<l;w++) {


    m = 0;
    n = 0;
    k = 0;
    q = 0;



    for (x = i[w];x < j[w]+1;x++) {

    k = 0;
    n = x;

    while (n != 1) {

    k+=1;

    if (n % 2 == 0) {

        n = n/2;

    }
    else
    {

    n = 3*n+1;

    }

    }
    k+=1;
    if (k>m) {

    m = k;

    }


    }

     printf("%li %li %li\n",i[w],j[w],m);
    }
    return 0;
}