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, 6, ['7349', 'S', '4839', 'R', '4443', '7569', '7307']
Example Output: 24200

Example Input: 15, 24, ['987', '1799', 'q', '4969', '7401', 'M', '1637', '423', 'D', '2883', 'O', '5667', 'z', 'k', '6791', 'O', 'o', '4693', '6961', 'E', 'k', 'm', 'g', 'O', '7131', 'I', '7671']
Example Output: 18445

Example Input: 3, 10, ['K', 'R', 'd', 'R', 'V', '7123', '7917', 'K', '6821', '533', 'v']
Example Output:
22394