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]: 14, 15, ['B', 'i', 'F', 'F', '7361', 'U', '6625', 'x', '7875', 'm', '5637', '9533', 'y', 'e', '5049', '3809', '1', '8269', '435', '2363', '1679', 'e', '8775', 'A', 'l', '161']
[A]: 5049


[Q]: 4, 6, ['v', 'f', '5021', 'v', 'M', '6345', '1159', 'C', '8173', '6299', 'r', '8877', 'a', 'm', 'k', '2935']
[A]: 6345


[Q]: 10, 20, ['6391', 'D', '1999', '5613', 'h', 'L', 'R', '3379', '9887', '1207', 'E', '3603', 'Y', 'u', '2177', 'k', '2005', 'P', '2379', 'b', '4787', 'J', '3413', 'R', '5255', 'B', 'S']
[A]:
11371