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, 1, ['x', 'g', 'X', 'j', 'k', '9821', 'n', 'd', '1709', 'r']
0

5, 6, ['W', '4759', '7861', '321', '5573', 'O', 'N', '157']
5573

3, 4, ['5757', '4779', '2787', '9829', '5389', 'Z', 'D', 'S', 'd', '7325', '8951', 'k', 'S', '9413', 'z']

12616