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.

[EX Q]: 11, 12, ['S', 'f', 'V', '7983', 'O', 'k', '699', '2831', 'C', 'B', 'B', '1263', 'b', '509', '8963', '8895']
[EX A]: 1263

[EX Q]: 2, 3, ['9191', 'D', '1937', 'N', 'g', '3485', '7327']
[EX A]: 1937

[EX Q]: 3, 4, ['h', 'w', 'L', 'L']
[EX A]:
0