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: 14, 26, ['U', 'D', '5391', '2975', 'b', 'b', '8741', '8991', '9083', '5401', '481', 'q', 'j', '8757', 'C', '2027', '6683', '5667', 'R', '631', 'm', '3743', '9769', '1039', '923', 'Q', '4373', '7451']
Example Output: 39239

Example Input: 2, 10, ['143', '3769', '197', '3281', '1839', '8009', 'J', '1019', 'Z', 'y', 'M', 'w', '827', '3603', 'r', '6401', '1039']
Example Output: 18114

Example Input: 3, 24, ['K', '685', 'r', '2833', '5629', 'I', 'o', '8049', '7325', '937', '5289', '4697', '5807', 'D', 'I', '6685', 'G', '8319', 'U', '2769', '1869', 'r', 'T', '4225', 'U', 'h']
Example Output:
64433