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: 13, 14, ['7395', '8249', 'n', '935', 'q', 'P', '7179', '2683', '8163', '4747', '2501', 'z', '7601', '7115', 'y', '53']

A: 14716
****
Q: 3, 16, ['1661', '2609', '7987', '619', '6765', '5249', '1377', '8971', 'J', 'o', '4803', 'O', '699', '4415', 'V', '1813', 'j', 'm', 'L']

A: 42698
****
Q: 2, 20, ['r', 'g', 'w', '979', 'J', 'F', '2891', 'L', '2109', '3251', '5413', '2497', 'S', 'Q', '8015', 'F', 'O', '5495', '8641', 'r', '9863', 'A', '2535']

A:
39291
****