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.

12, 24, ['3749', 'r', '9823', 'Y', 'K', 'V', 'q', 'H', '3273', '3091', '9531', 'E', '2219', '3101', 'P', 'k', 'r', 'a', 'T', 'I', 'j', 'i', '4045', 'K', 'r']
9365

3, 16, ['T', 'v', '2985', 'F', '8921', 'M', 'F', '4243', 'k', 'x', '435', 'B', '3335', '7613', 'M', '7809', 'q', '4147', 'h', '7523', 'R', '7589', '8795', 'O', 'L', '3371']
35341

1, 6, ['3417', 'D', 'p', 'y', '2875', '2485', 'B', '7493', '5797', 'p', 'r', '923']

8777