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.

13, 14, ['6693', 'J', '2765', 'P', 'h', '755', 'z', '7483', 'W', '6895', '1293', '3479', 'Y', '1667', '9635']
1667

9, 11, ['8449', 'j', '8735', '2839', '2773', '1659', 'V', 'I', 'x', 'V', 't', '7837', 'F', 'N', '4179', 'G', 'f', '8193']
0

4, 13, ['J', 'G', 's', 'd', 'B', '7815', '3449', '3737', '7953', 's', 'O', '4495', '1609', 'e', '4479']

29058