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.

Input: Consider Input: 6, 15, ['U', 'E', '6873', '7621', '9241', '147', '4503', 'z', '3805', 'n', '4331', '4031', '2585', '9029', 'a', '7537', '975']

Output: 28431


Input: Consider Input: 3, 5, ['b', 'a', 't', 'l', '8337', 'L', '913', 'O', '1009', '3615', 'u', 'E', 'Y', 'h', '51', '1673']

Output: 8337


Input: Consider Input: 15, 17, ['W', '6609', '3649', '4201', 'S', '1635', 'C', 'P', 'H', 'q', '8271', '8405', '4919', 'C', '4855', 'd', 'w', 'h', 'X', 's', '6051', 't']


Output: 4855