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, 9, ['9069', 'U', '6879', 'q', '8619', '5335', '8765', '7825', '9621', 'H', '9769', 'E', 'v', '1921']
[EX A]: 40165

[EX Q]: 3, 20, ['u', '5631', '6297', 's', '5839', 'l', '6967', '4097', '4643', '9645', 'q', 'i', '2963', 'R', '9539', 'j', 'M', '5607', '2651', '907', 'z', 'C', 'O']
[EX A]: 59155

[EX Q]: 19, 19, ['5523', '2167', '685', '3165', 'd', 'w', '2721', 'o', '9885', 'O', 'G', 'w', '6181', '1099', 'g', 'z', '6651', 'W', '259', '5687', 'D', 'S', '2557', 'j']
[EX A]:
259