public String isDivisible(int A, int B, int C, int D) {
		HashMap<Integer, Integer> mapA = getMap(A);
		HashMap<Integer, Integer> mapC = getMap(C);
		boolean isOK = true;
		for (Integer key : mapC.keySet()) {
			if (mapA.containsKey(key)) {
				long left = (long) mapA.get(key) * B;
				long right = (long) mapC.get(key) * D;
				if (left < right) {
					isOK = false;
					break;
				}
			} else {
				isOK = false;
				break;
			}
		}
		if (isOK) {
			return "divisible";
		}
		return "not divisible";
	}