aewlvM - Online Java Compiler & Debugging Tool

import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int m = scanner.nextInt();
        long mod = scanner.nextLong();
        long[] A = new long[n];
        long[] B = new long[m];

        for (int i = 0; i < n; i++) {
            A[i] = scanner.nextLong() % mod;
        }
        for (int i = 0; i < m; i++) {
            B[i] = scanner.nextLong() % mod;
        }

        Arrays.sort(B);
        long minB = B[0];
        long ans = Long.MAX_VALUE;

        for (long x : A) {
            long t = mod - x;
            int idx = Arrays.binarySearch(B, t);
            if (idx < 0) {
                idx = -idx - 1;
            }
            long candidate1 = Long.MAX_VALUE;
            if (idx < m) {
                candidate1 = x + B[idx] - mod;
            }
            long candidate2 = Long.MAX_VALUE;
            if (minB < t) {
                candidate2 = x + minB;
            }
            ans = Math.min(ans, Math.min(candidate1, candidate2));
        }

        System.out.println(ans);
    }
}