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]: 2, 8, ['r', 'H', 'K', 'K', '7307', 'i', '9381', '4175']
[A]: 20863


[Q]: 11, 14, ['H', '4643', 'k', '9583', 'K', '3497', 'Q', '8111', '1837', 'Z', '6885', 'L', '1759', '7777', '3137']
[A]: 16421


[Q]: 6, 9, ['K', 't', '6617', 'A', 'M', '7221', '8875', 'g', '9425', '8701', '2691', 'z']
[A]:
25521