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]: 6, 13, ['x', '8293', 'W', 'O', '511', 'y', '9801', '7925', '3353', 'J', 'D', 'J', 'B', '2559', 'j']
[EX A]: 21079

[EX Q]: 4, 5, ['1427', '7597', '765', 't', '7057', 'f', 'B', 'k']
[EX A]: 7057

[EX Q]: 2, 2, ['7131', '9369', 'U', '3587']
[EX A]:
9369