Betweeen Two Sets

import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;
import java.util.regex.*;

public class Solution {

    /*
     * Complete the getTotalX function below.
     */
    static int getTotalX(int max_a, int min_b, int[] a, int[] b) {
        int flag;
        int count = 0;
        for (int k = max_a; k <= min_b; k += max_a) {
            flag = 1;
            for (int num : a) {
                if (k % num != 0) {
                    flag = 0;
                }
            }
            for (int num : b) {
                if (num % k != 0) {
                    flag = 0;
                }
            }
            if (flag == 1) {
                count++;
            }
        }
        return count;
    }

    private static final Scanner scan = new Scanner(System.in);

    public static void main(String[] args) throws IOException {
        BufferedWriter bw = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

        String[] nm = scan.nextLine().split(" ");

        int n = Integer.parseInt(nm[0].trim());

        int m = Integer.parseInt(nm[1].trim());

        int[] a = new int[n];

        int max_a = 0;
        int min_b = 100;

        String[] aItems = scan.nextLine().split(" ");

        for (int aItr = 0; aItr < n; aItr++) {
            int aItem = Integer.parseInt(aItems[aItr].trim());
            if (aItem > max_a) {
                max_a = aItem;
            }
            a[aItr] = aItem;
        }

        int[] b = new int[m];

        String[] bItems = scan.nextLine().split(" ");

        for (int bItr = 0; bItr < m; bItr++) {
            int bItem = Integer.parseInt(bItems[bItr].trim());
            if (bItem < min_b) {
                min_b = bItem;
            }
            b[bItr] = bItem;
        }

        int total = getTotalX(max_a, min_b, a, b);

        bw.write(String.valueOf(total));
        bw.newLine();

        bw.close();
    }
}