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, 11, ['4195', 'G', '3905', '8825', 'J', 'I', 's', 'd', '2681', 'g', '3873', 'N', '9349']
Example Output: 23479

Example Input: 1, 10, ['H', 'P', '1985', '1797', '9115', 'V', 'o', '2405', '7817', 't', 'C']
Example Output: 23119

Example Input: 7, 13, ['7737', '9915', '9261', 'j', '8775', 'c', 'r', 'n', 'c', 'I', 'Z', 's', '6277', '1183', 'M', '5315', 'z']
Example Output:
6277