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, ['d', '6481']
0

5, 9, ['r', 'P', 'r', 'g', '5077', 'T', '2819', 'f', 'p', '6449', '8509', '8915', 'I', 'Z', 'N', '8657', 'R', '3739']
7896

1, 17, ['q', '6657', 'T', 'R', 'j', 'p', '4343', 'T', 'N', 'y', 'p', '397', 'v', '3191', '571', 'R', 'B', 'B', '59']

15159