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.

[Q]: 10, 17, ['479', '9493', '9061', '5585', 's', '9653', '5741', '7451', '2141', '9547', 'r', 'Z', '8915', '8289', '9281', '561', 'J', '3029', '3595', '7279', '7641']
[A]: 36593


[Q]: 6, 7, ['k', 'F', 'I', '1481', 'v', '5085', 'V', '9661', '525']
[A]: 5085


[Q]: 14, 20, ['E', 'v', '1227', 'a', 'A', 'J', '6107', '1815', 'u', '833', '3603', 'p', '273', 'k', 'R', 'O', 'o', 'C', 'x', 'C', '5797', 'U', '7835', '9797', 'y', 'I', 'b']
[A]:
0