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: 11, 16, ['3157', '9479', 'p', '551', '7723', 'I', 'E', 'L', '3983', 'J', '2037', 'q', '4041', 'U', 'n', 's']

A: 6078
****
Q: 4, 13, ['2921', '5905', '2835', '3625', '2481', '1657', '6239', '2393', 'u', '3255', '7061', '8197', 'k', '269', '1135', '5833', '7847', 'C', '4371', '4783', '9613']

A: 34908
****
Q: 8, 19, ['p', 'p', 's', '7851', '5077', '5185', '1791', '9803', '3321', 'Y', 'V', 'u', '9069', '7713', 'k', '4007', 'g', '1801', 'M', 'G', '2159']

A:
35714
****