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.

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


[Q]: 1, 5, ['O', 'T', 'V', '9035', 'L', 't', 'I']
[A]: 9035


[Q]: 5, 8, ['2403', '1001', 'x', '8215', 'J', '701', '9825', '5137', '3881', '4083', '9147', '101']
[A]:
15663