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

[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]: 12, 16, ['9599', 'V', 'f', 'z', 'M', 'q', '2697', '2039', 'p', '1241', 'i', '3029', 'E', 'N', '7787', 'O', '59', '2397', '8981', '3951', '1901', 'h', 'c']
[EX A]:
10816