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: 1, 10, ['H', 'P', '1985', '1797', '9115', 'V', 'o', '2405', '7817', 't', 'C']
Example Output: 23119

Example Input: 1, 4, ['9835', 'R', '8183', '4075', '8863', 'f', 'N', '3477', '1155', 'O', 'w', '595']
Example Output:
22093