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: 7, 18, ['o', '3007', '4747', '869', 'H', '7455', 'U', 'G', '6009', 'H', 'p', '381', '5217', 'q', '1251', 'G', 'i', 'X', '7649', '415', '8053', 'o']
Example Output: 12858

Example Input: 4, 17, ['n', 'U', 'b', '6139', '4187', '757', '2059', '5677', 'O', 'n', '73', 'F', '2573', 'K', 'I', '8921', '1483', 'C', '319', '7525', 'X', '3031', 'A', '6693', 'q', '549', 'N']
Example Output: 31869

Example Input: 8, 17, ['8781', '3181', '2665', 'P', '1943', 'I', '8595', 'Q', '6271', 'H', '9333', 'F', 'U', '1451', 'z', 'e', '9417', '8157', 'f', '6581', 'v', '1995', 'S', '2321', 'P', '8769']
Example Output:
26472

