def can_measure_water_brute_force(jug_a_capacity, jug_b_capacity, target_capacity):
    visited_states = set()
    queue = [(0, 0)]

    while queue:
        current_state = queue.pop(0)
        jug_a_amount, jug_b_amount = current_state

        # Check if we've reached the target
        if jug_a_amount == target_capacity or jug_b_amount == target_capacity or jug_a_amount + jug_b_amount == target_capacity:
            return True

        # Avoid infinite loops by tracking states
        if current_state in visited_states:
            continue

        visited_states.add(current_state)

        # Generate all possible next states
        next_states = [
            (jug_a_capacity, jug_b_amount),  # Fill jug A
            (jug_a_amount, jug_b_capacity),  # Fill jug B
            (0, jug_b_amount),              # Empty jug A
            (jug_a_amount, 0),              # Empty jug B
        ]

        # Pour jug A to jug B
        pour_amount = min(jug_a_amount, jug_b_capacity - jug_b_amount)
        next_states.append((jug_a_amount - pour_amount, jug_b_amount + pour_amount))

        # Pour jug B to jug A
        pour_amount = min(jug_b_amount, jug_a_capacity - jug_a_amount)
        next_states.append((jug_a_amount + pour_amount, jug_b_amount - pour_amount))

        # Add the next states to the queue for processing
        queue.extend(next_states)

    return False

def can_measure(jug1_capacity, jug2_capacity, target_capacity):

    def gcd(a, b):
        while b:
            a, b = b, a % b
        return a

    # Impossible if target exceeds combined capacity.
    if target_capacity > jug1_capacity + jug2_capacity:
        return False

    # Check if target is multiple of GCD.
    greatest_common_divisor = gcd(jug1_capacity, jug2_capacity)

    if target_capacity % greatest_common_divisor != 0:
        return False

    # At this point the target is potentially achievable.
    return True