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]: 1, 5, ['t', 'd', 'q', 'T', '1671', '3187', '7659', '8767', '1921', '8653', '5495', 'w', '2243', '5765', '9227', 'G', 'f', 'i', '6591', 'h', 'O', '4503', 'P', 'A', 'U', 'S', 't', 's', '6873']
[EX A]: 1671

[EX Q]: 2, 10, ['9653', '3845', 'm', 'K', 'j', '5041', 'W', 's', 'j', 'A', 'G']
[EX A]: 8886

[EX Q]: 3, 9, ['2807', '2171', '7389', 'v', '2317', 's', 'Z', '2115', 'n']
[EX A]:
11821