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]: 11, 19, ['Y', 'r', 't', '2931', '9519', '1071', '2417', 'p', 'F', '7509', 'l', '3451', '1907', 'z', 'E', 'n', '1251', 'k', 'p']
[EX A]: 6609

[EX Q]: 1, 2, ['8895', 't', '5739']
[EX A]: 8895

[EX Q]: 1, 4, ['5875', '6675', 'R', 'x', '6357', 'q', 'h']
[EX A]:
12550