def desperate_move(heaps):
    """
    Computes a move when all is lost and the only possibility is for the
    other player to make a mistake.

    The strategy is to remove one item from the first heap with elements.

    :param heaps:
    :return:
    """
    for index, heap in enumerate(heaps):
        if heap > 0:
            return index, 1
    return 0, 0