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, ['p', 'N', '7935', '1649', '1509', 'N', 'q', 'L', '1917', '9753', 'C', '6387', '4037', 'D', '1099', '5329', '1703', '7715', 'c']
Example Output: 34286

Example Input: 2, 16, ['e', 'Q', '4017', '1999', '2413', 'v', '4911', 'N', 'x', '3475', '2179', 'o', 'a', '6361', '1723', '6273']
Example Output: 33351

Example Input: 11, 17, ['2329', 'n', 'H', 'J', 'X', 'Q', '6027', 'b', '5251', 'u', 'o', 'a', 'E', '9665', '7685', '3787', 'I']
Example Output:
21137