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.

9, 12, ['6001', '6723', '1813', 'S', '3331', 'T', '297', '8105', '7529', 'f', '1459', '323', '8077', 'N', 'W', 'G', 's', 'z', '7559', 't', 'F', 'h', '3771', '975']
9311

1, 2, ['8235', 's']
8235

20, 27, ['2899', '4289', '5417', '8899', 'z', '4599', 'd', 'Y', 'Z', '3219', 'U', 'F', '2669', 'r', 'A', '143', '7665', 's', '229', 'I', '3197', 'f', 'u', 'W', 'W', 'X', 'y']

3197