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]: 9, 9, ['G', '9137', 'G', '2393', '9383', 'r', '6897', '547', 'W', 'h', 'p', '4557']
[EX A]: 0

[EX Q]: 1, 6, ['k', '9169', '53', '2733', 'T', 'E', '5793', '8823', '3045', 'z', 'L', '5357', '4585', 'V', 'C', '8679', 'y', '5801', '9671', '9131', 'W', '6763', 'p', 'r', '9785', '7431', 'P', '913']
[EX A]:
11955