FndyfX - Online Java Compiler & Debugging Tool

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        long L = scanner.nextLong();
        int N = scanner.nextInt();
        int K = scanner.nextInt();
        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = scanner.nextLong();
        }

        int countOutput = 0;
        long d = 0;
        while (countOutput < K) {
            Map<Long, Integer> pointToIndexMap = new HashMap<>();
            for (int i = 0; i < N; i++) {
                long x1 = A[i] - d;
                if (x1 >= 0 && x1 <= L) {
                    pointToIndexMap.putIfAbsent(x1, i);
                }
                long x2 = A[i] + d;
                if (x2 >= 0 && x2 <= L) {
                    pointToIndexMap.putIfAbsent(x2, i);
                }
            }

            int countD = 0;
            for (Map.Entry<Long, Integer> entry : pointToIndexMap.entrySet()) {
                long x = entry.getKey();
                int idx = entry.getValue();
                long minDist;
                if (x <= A[idx]) {
                    minDist = A[idx] - x;
                    if (idx > 0) {
                        minDist = Math.min(minDist, Math.abs(x - A[idx - 1]));
                    }
                } else {
                    minDist = x - A[idx];
                    if (idx < N - 1) {
                        minDist = Math.min(minDist, Math.abs(x - A[idx + 1]));
                    }
                }
                if (minDist == d) {
                    countD++;
                }
            }

            for (int i = 0; i < countD && countOutput < K; i++) {
                System.out.println(d);
                countOutput++;
            }
            d++;
        }
    }
}