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.

8, 13, ['6413', 'n', 'z', 'T', 'R', 'Y', 'D', 'W', 'L', '521', '3411', 'B', 'O', '6757']
3932

2, 4, ['L', '8053', '8121', 'J', 'H', '7591', 'U', 'm']
16174

9, 18, ['5243', '7157', 't', 'r', '4583', 'W', '7893', 'd', 'i', 'L', '2033', '4501', 'x', 'R', '9061', '743', '547', '7787', '9921', '8463', 'L', '237', '3349', 'I']

24672