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, 12, ['465', 'V', '3045', 'M', 'Z', '4053', '9621', '6909', '3161', 'M', '6675', '2313', 'v', 'g', 'a', 'x', '9347', 'd', 'x', '4309', '7231', '9745', 'F', '8863', '4667', '2089', 'x']
[EX A]: 8988

[EX Q]: 2, 9, ['4437', 'g', 'I', 'u', '4299', '45', '4397', '5327', '5301', 'J', 'K', '4129', 'W', '8567']
[EX A]: 19369

[EX Q]: 2, 3, ['3743', '4773', '385', '2901', '2243', '4679']
[EX A]:
5158