Reaching Ground Floor in Python

'''calculate nearest stair'''
def nearest_distance(row,pos):
    #compare distance to left stair and distance to right stair
    left = -1
    right = -1
    for i in range(pos,-1,-1):
        if(row[i]==1):
            left=i
            break
    for i in range(pos,len(row)):
        if(row[i]==1):
            right=i
            break
    if(right==-1):
        return left
    elif(left==-1):
        return right
    elif((pos-left)<(right-pos)):
        return left
    else:
        return right

'''find the fastest route'''
def route(matrix,rows,cols):
    path = list()
    rows = len(matrix)

    pos = matrix[0].index(3)
    path.append(f'R1 C{pos+1}')
    num=2
    nex=pos
    
    for i in range(1,rows-1):
        nex = nearest_distance(matrix[i],nex)
        
        path.append(f'R{num} C{nex+1}')
        num +=1
    
    
    path.append(f'R{rows} C{cols}')

    return "->".join(path)


'''input'''
r,c = map(int,input("Enter Dimensions R and C: ").split(" "))

matrix = list()

print("Enter contents: ")

for i in range(r):
    row = list(map(int,input().split()))
    matrix.append(row)

'''output'''
print("The quickest path is: ", route(matrix,r,c))