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]: 2, 9, ['7111', '835', 'W', '6975', '4459', 'B', 'B', 'Z', 'o']
[EX A]: 12269

[EX Q]: 3, 16, ['T', 'v', '2985', 'F', '8921', 'M', 'F', '4243', 'k', 'x', '435', 'B', '3335', '7613', 'M', '7809', 'q', '4147', 'h', '7523', 'R', '7589', '8795', 'O', 'L', '3371']
[EX A]: 35341

[EX Q]: 10, 21, ['p', '7175', '1539', '1355', '7231', 'q', 'T', 'T', '6565', '9083', 'H', 'T', 'H', '2571', 'V', 'M', 'o', 'V', 'D', 'd', '8939', 'C', 'x', '9769']
[EX A]:
20593