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: 3, 6, ['l', 'C', '6183', 'd', '6519', 'm']
Example Output: 12702

Example Input: 3, 4, ['u', '5041', 'E', 'U', 'a', 'd']
Example Output: 0

Example Input: 1, 19, ['2063', '591', 'L', 'Q', '8869', '8733', 'i', '7939', 'Z', 'E', '2879', '943', 'v', '4077', 'm', 'v', '3053', 'c', 'v', '349', '1367', 'q', 'U', 't', 'y', '5409', 'I', '4229', 'P', '8009']
Example Output:
39147