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.
3, 22, ['4315', '1719', '557', 'X', '5357', 'V', '935', 'Q', 'y', 't', '4337', 'F', 'b', '8791', '9581', '2769', '5131', 'u', 'B', '8133', 'b', 'R', '31', 'r', 'W', '3797', '2011', '2979', 'S']