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.

Ex Input:
7, 12, ['273', 'h', '2433', '7155', '731', '5459', 'q', 'G', 'i', 'l', '3981', 'W', 'V', '4999', '8191', 'K', '8393', '9255']

Ex Output:
3981


Ex Input:
7, 18, ['o', '3007', '4747', '869', 'H', '7455', 'U', 'G', '6009', 'H', 'p', '381', '5217', 'q', '1251', 'G', 'i', 'X', '7649', '415', '8053', 'o']

Ex Output:
12858


Ex Input:
8, 26, ['9895', '6069', '9911', '1925', '641', '6863', '3699', '8253', '6007', '8175', '2199', 'n', '5429', '89', 'Q', '6855', '3059', '9141', 'J', '7345', 'k', 'z', '6705', '8685', 'E', 'a', '9015']

Ex Output:

71942