C#Exams 4. Hayvan Numbers (on Java Code)

import java.util.Scanner;

public class _4_HayvanNumbers {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner scan = new Scanner(System.in);
        int sum = scan.nextInt();
        int diff = scan.nextInt();

        boolean foundHayvanNums = false;
        if (sum >= 45 && sum <= 81 && diff <= 222) {
            foundHayvanNums = findAndPrintHayvanNumbers(sum, diff);
        }

        if (!foundHayvanNums) {
            System.out.println("No");
        }
    }

    private static boolean findAndPrintHayvanNumbers(int sum, int diff) {
        // TODO Auto-generated method stub
        boolean foundNums = false;
        int a, b, c, d, e, f, g, h, i;
        int abc, def, ghi, digitSum;
        for (a = 5; a < 10; a++) {
            for (b = 5; b < 10; b++) {
                for (c = 5; c < 10; c++) {
                    abc = (a * 100) + (b * 10) + c;
                    for (d = 5; d < 10; d++) {
                        for (e = 5; e < 10; e++) {
                            for (f = 5; f < 10; f++) {
                                def = (d * 100) + (e * 10) + f;
                                if (def - abc == diff) {
                                    for (g = 5; g < 10; g++) {
                                        for (h = 5; h < 10; h++) {
                                            for (i = 5; i < 10; i++) {
                                                ghi = (g * 100) + (h * 10) + i;
                                                if (ghi - def == diff) {
                                                    digitSum = a + b + c + d
                                                            + e + f + g + h + i;
                                                    if (digitSum == sum) {
                                                        System.out.println(""
                                                                + abc + def + ghi);
                                                        foundNums = true;
                                                    }
                                                }
                                            }
                                        }
                                    }
                                }
                            }
                        }
                    }
                }
            }
        }

        return foundNums;
    }

}