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.

1, 1, ['x', 'g', 'X', 'j', 'k', '9821', 'n', 'd', '1709', 'r']
0

6, 15, ['H', 'u', 'Y', 'Z', 'm', '1897', 'u', '2511', '507', '4977', '2019', '8913', 'Q', '5835', '1787', 'q', '1197']
28446

7, 12, ['Y', 'S', 'd', '2585', '7787', '1757', '2745', '7073', 'S', '9607', 'h', 'T', '2419', '7877', '677', 'O', 's', '2201', '6575', '5635', 'I', '5193', '3209', 'I', 'm', 'R']

19425