static int beautifulDays(int i, int j, int k) {

    int count = 0;
    for(int m = i ; m <= j ; m++){
        int reverse = reverseNumber(m);
        if((Math.abs(reverse - m) % k) == 0){
            count++;
        }
    }

    return count;

}

static int reverseNumber(int number){
    Stack<Integer> digits = new Stack<Integer>();
    while(number > 0){
        int remainder = number % 10;
        digits.push(remainder);
        number /= 10;
    }
    int reversedNumber = 0;
    int count = 0;
    while(!(digits.isEmpty())){
        reversedNumber += digits.pop() * Math.pow(10, count);
        count += 1;
    }

    return reversedNumber;
}