Hey, Path Finder, where are you?
## Path Finder Series:
-       [#1: can you reach the exit?](https://www.codewars.com/kata/5765870e190b1472ec0022a2)
-       [#2: shortest path](https://www.codewars.com/kata/57658bfa28ed87ecfa00058a)
-       [#3: the Alpinist](https://www.codewars.com/kata/576986639772456f6f00030c)
-       [#4: where are you?](https://www.codewars.com/kata/5a0573c446d8435b8e00009f)
-       [#5: there's someone here](https://www.codewars.com/kata/5a05969cba2a14e541000129)
direction = [(1, 0), (0, 1), (-1, 0), (0, -1)]
operations = {'l': +1, 'r': -1, 'L': -2, 'R': 2}
vector = 2
position = [0, 0]

def i_am_here(path):
    nonlocal vector, position
    step = 0
    for c in path:
        if c.isnumeric():
            step = step * 10 + int(c)
        else:
            if step > 0:
                position = [position[0] + direction[vector][0]*step, position[1] + direction[vector][1]*step]
                step = 0
            step = 0
            o = operations.get(c)
            vector += o
            vector %= len(direction)
    if step > 0:
        position = [position[0] + direction[vector][0] * step, position[1] + direction[vector][1] * step]
    return position

direction = [(1, 0), (0, 1), (-1, 0), (0, -1)]
operations = {'l': +1, 'r': -1, 'L': -2, 'R': 2}
vector = 2
position = [0, 0]

def i_am_here(path):
    nonlocal vector, position
    step = 0
    for c in path:
        if c.isnumeric():
            step = step * 10 + int(c)
        else:
            if step > 0:
                position = [position[0] + direction[vector][0]*step, position[1] + direction[vector][1]*step]
                step = 0
            step = 0
            o = operations.get(c)
            vector += o
            vector %= len(direction)
    if step > 0:
        position = [position[0] + direction[vector][0] * step, position[1] + direction[vector][1] * step]
    return position
