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: 14, 15, ['Q', '2131', 'X', 'u', 'y', '9699', '7305', '3017', '8151', 'X', '9723', '7907', 'j', '1527', 'u', 'D', 'b', '7735', '1713']

A: 1527
****
Q: 4, 16, ['B', 'u', 'M', 'C', '9069', '815', '2175', '6087', 'o', '115', '9559', '2365', 'Z', 'e', '277', '1889', '6181', '6895', 'm']

A: 32351
****
Q: 1, 2, ['r', 'm']

A:
0
****