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: 5, 6, ['i', 'i', 'J', 'O', '4571', 'o', '2073', '87', 'x', '9937', '9917', '4283', 'S']

A: 4571
****
Q: 19, 19, ['4147', '1103', '5749', 'c', '5103', '3491', '4511', '197', 'T', '1601', 'J', 'c', '1309', 'a', '607', 'p', 'C', '9473', '5221', 'D', 'U', 'O', '5013']

A: 5221
****
Q: 12, 14, ['n', '777', '5651', 'e', '7323', 'r', '1557', 'A', '9403', 'm', '8065', 'W', 'P', 'x']

A:
0
****