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]: 11, 13, ['O', '4429', 'F', '2013', 'v', 'p', 'y', '507', 'g', '935', '1827', 'Q', '4267', 'A', 'm', 'g', 'k', 'S', 'a', 'C', 'q', 'W', 'M']
[EX A]: 6094

[EX Q]: 2, 4, ['m', 's', 'Y', '7857', 'g', '2765', '4423', '5161', 'l', 'h', '9651', '3783', 'w', '8749', 'n', 'U', '4645', '7205', '7419', '2509', 'y', '9211', '4229', '4663', '7869', '5337', '1949']
[EX A]:
7857