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]: 2, 5, ['4487', '3761', '159', '7459', '6781', '2403', 'S', '3079', '7161']
[A]: 18160


[Q]: 1, 9, ['T', '8311', 'D', '8617', 'V', 'a', '1837', 'x', '2337', 's']
[A]:
21102