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.

Example Input: 1, 15, ['k', 'z', 'D', '4827', '8921', 'o', 'e', 'U', 'f', '7419', 't', 'Z', 'c', '4089', '1117', '2309', '9095']
Example Output: 26373

Example Input: 1, 13, ['9225', '8983', 'E', 'F', 'L', 'V', 'h', '9233', '8887', 'o', 'd', 'U', 'B', 'u']
Example Output: 36328

Example Input: 2, 5, ['L', 'O', 'q', '4299', 'q', 'X']
Example Output:
4299