For this Question: Aarav is standing at location X and Reena is standing at location Y. In one step Aarav can increase or decrease his location by at most A. What is the minimum no. of steps required by Aarav to reach Reena?The first line of input will contain a single integer T, denoting the number of test cases. Each test case consists of three integers X, Y, and A, the initial coordinate of Aarav, the initial coordinate of Reena and the maximum number of coordinates Aarav can move in one step.

<b>Constraints</b>
1 &le; T &le;1000
1 &le; X, Y &le; 100
1 &le; A &le; 100For each test case, output the minimum number of steps required by Aarav to reach Reena.<b>Sample Input</b>
4
10 20 3
36 36 5
50 4 100
30 4 2
<b>Sample Output</b>
4
0
1
13
<b>Explanation</b>
Test case 1: Here Aarav is at point 10 and Reena at psoint 20 so after waling one step Aarav will reach coordinate 13 similarly after 3 steps Aarav location will be 18. Now 3 steps Aarav have walked and only 2 steps way he is from Reena so one more step is needed of length 2. i.e. making a total of 4 steps.
Test case 2: Aarav and Reena are already at the same point., I have written this Solution Code: import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Main
{
    public static void solve(){
        int x = sc.nextInt();
        int y  = sc.nextInt();
        int k = sc.nextInt();
        
        int need = Math.abs(x-y);
        int ans = (int) Math.ceil(1.0*need/k);
        
        out.println(ans);
    }
    
	static PrintWriter out;
    static Scanner sc;
    public static void main (String[] args) throws java.lang.Exception
    {
        sc = new Scanner();
        out = new PrintWriter(System.out);

        int t = sc.nextInt();
        while(t-->0){
            solve();
        }
        out.close();
    }

    private static long power(long a, long b) {
        long res = 1;
        while (b > 0) {
            if ((b & 1)==1)
                res = res * a;
            a = a * a;
            b >>= 1;
        }
        return res;
    }

    private static long power(long a, long b, long m) {
        a %= m;
        long res = 1;
        while (b > 0) {
            if ((b & 1)==1)
                res = res * a % m;
            a = a * a % m;
            b >>= 1;
        }
        return res;
    }

    private static long lcm(long a, long b) {
        return a * b / gcd(a, b);
    }

    private static long gcd(long a, long b) {
        return (b == 0) ? a : gcd(b, a % b);
    }

    static class Scanner {
        BufferedReader br;
        StringTokenizer st;

        public Scanner() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
/*
            try {
                br = new BufferedReader(new
                        InputStreamReader(new FileInputStream(new File("file_i_o\\input.txt"))));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
*/
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

        int[] nextIntArray(int n) {
            int[] array = new int[n];
            for (int i = 0; i < n; i++) {
                array[i] = nextInt();
            }
            return array;
        }

        Integer[] nextIntegerArray(int n) {
            Integer[] array = new Integer[n];
            for (int i = 0; i < n; i++) {
                array[i] = nextInt();
            }
            return array;
        }

        long[] nextLongArray(int n) {
            long[] array = new long[n];
            for (int i = 0; i < n; i++) {
                array[i] = nextLong();
            }
            return array;
        }

        String[] nextStringArray() {
            return nextLine().split(" ");
        }

        String[] nextStringArray(int n) {
            String[] array = new String[n];
            for (int i = 0; i < n; i++) {
                array[i] = next();
            }
            return array;
        }
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?