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]: 5, 22, ['t', '8483', '8799', 'W', 'l', '2567', '2787', 'L', 'G', 'T', '5765', '5029', '8059', '8505', '6905', 'Z', '8153', 'e', 'K', '3529', 'g', '2667', '6629', 'O']
[EX A]: 53966

[EX Q]: 2, 5, ['8407', '1329', '2243', '2547', '5371', '6023', '7139', 'K', '339', '3301', '6771', 'Z', '9983', '17', 'V']
[EX A]: 11490

[EX Q]: 23, 26, ['8009', 'w', '4919', '7841', '463', '1717', 'J', 'M', 'e', '4899', '3515', 'H', 'o', '9627', 'I', 'p', '1631', '8987', '2289', 'a', 'L', 'l', '8227', 'M', '4845', '7397']
[EX A]:
20469