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]: 12, 20, ['V', 'H', '5509', 'J', '887', '6361', '4273', '1017', '5167', 'G', 'g', '5185', '2617', 'h', 'Y', '7697', '5075', 'F', '2675', '29', 'K', '2081', 'R', '7011']
[A]: 23278


[Q]: 4, 7, ['7463', '6237', 'v', '9817', '969', '6317', 'N', 'k', '2023']
[A]: 17103


[Q]: 4, 6, ['J', 'I', 'l', 'c', '737', 'i', 'h', '6633', 'm', '6007', '4565', '3035']
[A]:
737