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, 3, ['c', '2957', 'u', '2321', 'q', 'P', '2347', 'O', 'P', '4463', 'u']
2957

4, 8, ['6669', 'G', 'y', '129', 'y', 'x', 'w', 'C', 'J']
129

2, 3, ['4757', '4603', 'W', '2421', '8039', 'E', 'p', 'a', 'P', 'B']

4603