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, 4, ['F', '7341', 'P', '3315']
Example Output: 3315

Example Input: 4, 12, ['k', '7775', '1099', '1507', '7609', 'X', 'O', '521', 'u', 'V', 't', '1935', '8171', '2063', 'h', '2961', 'z', '4955', '1359', 'm', '2137']
Example Output: 11572

Example Input: 1, 10, ['I', '521', 'T', 'u', 'I', 'l', '9395', 't', 'J', '9477', '3649', '631', '9771', 'p', '1633', 'c', 't', 'O', '2987', 'I', '4131', '4979', 'W', '6417', 'd', '1385']
Example Output:
19393