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]: 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']
[A]: 1671


[Q]: 6, 8, ['s', 'X', 'a', 'L', 'N', 'J', '1893', '4909', '349', '7679', '4479', 'i', '7345']
[A]: 6802


[Q]: 1, 15, ['x', 'E', '4367', '4525', '1819', 'B', '1587', 'T', '7715', 'z', 'B', '793', 'm', '4895', '4665', 'y', 't', '3987', '187', 'f', 'P', 'N', '285']
[A]:
30366