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.

11, 15, ['W', '8193', '2581', 'f', 'j', '5727', 'A', '6177', 'u', '4201', 'T', 'w', 'C', 'u', '7973', 'd', 'c']
7973

10, 14, ['E', 'P', 'm', 'o', '4203', '657', 'Z', '9975', 'p', '4013', 'M', 'm', '7369', 'x', 'K', 's', '9411', '9787', '4293', '8229']
11382

3, 5, ['8671', '6355', 't', '4809', 'L', 'S', '6321', 'J', 'Z', '6523', '3583', '4537', '4725', 'L', '7489', '3951', '1075', 'r', 'g', 'P', '7149', '2755', 'g', 'r', 'x', '6533', 'C', 'B', '4343', 'j']

4809