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: 2, 3, ['o', 'p', '4765', 'u', '629', 'p']
Example Output: 4765

Example Input: 19, 21, ['y', '9403', 'C', '389', '5521', '9271', 'W', 'B', '3613', 'w', '2741', 'H', '8305', '727', '7641', '5857', '9183', '1297', 'p', '7371', 'b']
Example Output: 7371

Example Input: 8, 16, ['4475', 'G', '7501', 'e', '4227', 'S', '3147', '8545', 'B', '8899', 'z', 'c', '7461', 'R', '2245', '6243', '8041', '2873', '1059', 'a']
Example Output:
33393