In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.

1, 15, ['9611', 'm', '8001', '7451', 'O', '753', 'F', 'F', '3017', '8265', 'j', '5753', 'B', 'Q', '4079', 'k', 'N', '5197', '3885', '3193']
46930

3, 4, ['2879', '5161', 'v', 'c', 'P', 'T', 'p', '6905', 'F']
0

10, 24, ['R', 'w', 'O', 'H', 'j', '6543', '9729', 'X', 'x', '5069', 'N', '2661', 'g', '3627', 'L', 'h', 'h', 'H', '5231', '1941', 'r', '7049', 'n', '4589']

30167