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]: 3, 5, ['a', 'q', 'a', '4295', 'z', '675', '3975', 'P', 'e', '4231', '2547', 'V', 'S', '5285', 'Y', 'J']
[EX A]: 4295

[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, ['z', '9873', '6741', 'W', 'p', 'i', '1563', 'C', '5479', '93', '1061', '5067', '4123', '2227', 'e', '2647', 'd', 'i', '9', 'P', 'P', '2203', '8669', 'M', 'g', 'l']
[EX A]:
16614