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, ['O', 'T', 'V', '9035', 'L', 't', 'I']
[EX A]: 9035

[EX Q]: 1, 1, ['7479', 'q', 'F', '5725', '7697', '6653', '275', 'l', '7349', 'c']
[EX A]: 7479

[EX Q]: 9, 16, ['l', 'W', '4261', 'j', '565', 'u', '5127', '2653', 'V', '9929', 'X', '9571', 'b', '1231', 'y', 'I', '6229', 'e', 'M', 'q', '7451', 't', 'N', 'H', 's', 'J', '543', '4597', '2345']
[EX A]:
20731