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: 4, 12, ['E', '6343', 'f', '541', '7361', '9993', 'g', '3185', 's', 'w', 'Q', 'I', 'e', 's']
Example Output: 21080

Example Input: 6, 11, ['m', '455', 'u', 'C', 'b', 'N', 'A', 'W', 'M', '3811', 'K', '657', 's', '2839', 'E', 'E', '2733', '6733', 'c', 'P', 'V']
Example Output: 3811

Example Input: 11, 19, ['c', '3489', 'K', 'a', '8387', '4561', 'C', '6069', '4959', '4015', 't', '4601', 'F', 'E', '7657', '8243', 'k', 'N', '7961', 'K', '5897', '7013', 'G', '2879']
Example Output:
28462