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.

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

9, 16, ['8223', '3639', '9643', '4457', 'q', 'q', '8831', '3521', 'h', 'H', 'C', '3965', 'a', '1559', 'u', '9189', '5355', 'u', 'h', 'y', 'D', 'p', 'S']
14713

4, 9, ['c', 'm', 'H', 'x', '5941', '3421', '4951', 'Q', 'h', '101', '329', 'R', 't', '4583', '1997', 'l', 'W', 'M', '9795', '2171']

14313