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.

Q: 9, 9, ['8073', 'i', '5725', 'j', '4631', 'h', '245', '2191', '2445', '267', 'V', 'D', '3385', 'W']

A: 2445
****
Q: 6, 18, ['5051', 'g', 'C', 'p', 'O', 'i', 'E', '4947', '5345', '8453', '4967', '3749', 'F', 'P', '5045', 'o', '5605', 'H', '9319', '5471', 'F', 'B', 't', 'H']

A: 38111
****
Q: 8, 10, ['7599', 'X', 'B', '5007', 'G', 'q', 'a', 'C', '6903', 'n', '2559', '7683']

A:
6903
****