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: 6, 15, ['U', 'G', '4461', '7163', '5651', 'x', '4017', 'W', '7237', 'k', 'b', 'k', 'h', '9147', 'T', '9035', '537', 'Y', 'Q']

A: 20401
****
Q: 4, 13, ['5653', '9869', '5325', '7307', '5513', '2167', '2393', 'p', 'F', '2011', '5431', '2695', 'v', 'p', '3743', 'j', 'y', '5903', '5135', '467', '8443', 'C', 'i', 'w', 'y']

A: 27517
****
Q: 22, 22, ['293', 'z', '1429', '7031', 'k', 'd', '4973', 'x', '1885', '1907', '3951', '8051', 'G', 'H', 'O', 'r', '3223', '563', 'W', '1933', 'X', '345', 'B']

A:
345
****