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: 2, 15, ['l', '5597', 'M', 'l', '6065', '7949', 'e', '433', '8159', 'N', 'Z', '5597', 's', 'k', '6973', '8387', 'n', 'W', '9895']

A: 40773
****
Q: 1, 7, ['173', '5875', 'C', '7417', '3565', '1949', '537', '7707', 'o', 'y']

A: 19516
****
Q: 18, 19, ['8701', 's', 'Y', 'm', '2961', 't', 'c', 'd', 'x', 'u', '2207', '1569', '5525', '5941', '9377', 'h', 'q', '321', 'A', '4121', 't', '4217', '8073', 'q', 'z', 'Y']

A:
321
****