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

1, 6, ['3309', 'w', '1143', 'D', 'Z', 'd']
4452

24, 27, ['o', '9731', '1749', 'g', 'O', '9141', 'K', 'n', '4349', 'x', '3389', '4963', '1557', 'd', '2807', 'c', 'W', 'Z', 'A', '1613', '1143', '6557', '1677', '4253', 'J', '2845', 'x', 'y']

7098