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.

6, 13, ['x', '8293', 'W', 'O', '511', 'y', '9801', '7925', '3353', 'J', 'D', 'J', 'B', '2559', 'j']
21079

5, 9, ['9825', '3055', '9869', 'B', 'a', 'W', 'Q', 'k', '4383', 'Q', '8523', 's', 'R', '1481', '5887', '239', 'M', '7121', '6311']
4383

2, 7, ['f', '5605', '3125', 'I', 'q', 'D', 'K', '5321', '2303', '8753', 'q', 'f', '3645', 'T', '6421', 'I', '209', 'R', 'R', '8541', 's', 'D', '4257', '765', 'T', 'u', 'n', 'g']

8730