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.

20, 26, ['8183', 'I', 'o', 'B', '7567', '4953', '8133', '2883', 'g', 'D', '865', 'a', 'y', 'Z', 'F', '3211', 'e', 'X', '5135', '7257', 'G', '1577', '7977', 'X', 'z', 'e']
16811

2, 10, ['f', 'r', 'Z', '1989', '5035', '1623', '9335', '7495', '8663', '2199', '2047', 'o']
36339

3, 10, ['d', '8803', '8953', '1133', 'w', '9655', '8069', '7915', 'G', '4243', 'C', 'g', 'c', 'f', 'j', '6841', 'l', 'c', '3597', 'o', 'T', '507', 'j', '5453', 'H', '7199', '4769', '2797']

39968