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.

[EX Q]: 10, 16, ['V', 'b', '2575', '385', 'U', 'I', 'Y', '2647', 'V', 'k', '6379', 'W', '1883', 'n', 'K', '3001', '6791', 'I', '4285', 'f', 'i']
[EX A]: 11263

[EX Q]: 2, 4, ['3155', '581', 'N', '153', 't', '7941', '6065']
[EX A]: 734

[EX Q]: 10, 13, ['j', 'n', '6321', '2535', '8303', 'x', '2483', '7963', '8379', 'T', '8493', '5775', 'S', 'O']
[EX A]:
14268