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, 6, ['l', 'C', '6183', 'd', '6519', 'm']
[A]: 12702


[Q]: 9, 9, ['V', 'x', '3763', '8367', '3369', '6695', 'p', 'P', 'L', 'g', 's', '5117', 'n', '5097', '2407', '6337', '5437', 'o', '3023', 'D', 'g']
[A]: 0


[Q]: 2, 4, ['7899', '4465', 'M', '2739', 'E', 'Q', '6719', 'L', 'p', 'x', 'b']
[A]:
7204