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: 4, 8, ['3753', 'y', '417', 'B', 'g', 'D', 'L', '6175']

A: 6175
****
Q: 11, 19, ['Y', 'r', 't', '2931', '9519', '1071', '2417', 'p', 'F', '7509', 'l', '3451', '1907', 'z', 'E', 'n', '1251', 'k', 'p']

A: 6609
****
Q: 13, 13, ['I', 'N', '9131', 'z', '3371', '3329', 'l', 'K', '7353', 'V', 'p', '1581', 'C', 'v', 'g', 'h', 'R', '7503', 'B', '2243', 'H', 'J', 'k', '2889', '9111', 'K', 'f', '2525']

A:
0
****