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.

Q: 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']

A: 35341
****
Q: 1, 5, ['O', 'T', 'V', '9035', 'L', 't', 'I']

A: 9035
****
Q: 19, 23, ['8877', '5719', 't', 'i', '7879', '1363', '8521', '2733', 'J', '3293', '5845', 'e', 'E', 'o', 'B', 'H', '9957', 'G', 'L', 'j', 'J', 'b', '19', 'y', 'G', 'P', '1639', '9149']

A:
19
****