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.

2, 9, ['3707', 'J', 'H', '8907', '597', 'Z', '9725', 'g', 'R']
19229

1, 5, ['t', 'd', 'q', 'T', '1671', '3187', '7659', '8767', '1921', '8653', '5495', 'w', '2243', '5765', '9227', 'G', 'f', 'i', '6591', 'h', 'O', '4503', 'P', 'A', 'U', 'S', 't', 's', '6873']
1671

13, 24, ['6929', '223', '957', '8089', '8241', '5419', 'F', 'I', 'W', 'W', '2929', '3051', 'y', 'I', '1769', '5539', 'u', 'C', '3773', 'y', 'r', 'n', '1945', '665']

13691