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, 11, ['R', 'k', '4813', '655', '3185', 'M', '4199', '1857', '9829', '6389', 'X', '3405', 'P', 'x']
30927

1, 2, ['9621', '3231', '5905', 'M', '3233', 'j', '2449', '3805', '4923', '235', '407', 'w']
12852

3, 13, ['3139', '4131', '6407', '1369', 'E', '9239', '7203', 'g', '7309', '6201', 'p', '5097', 'k', '3437', '4807', '7981', '3571', 'e', '543', '2157', 'Y', '2583']

42825