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]: 9, 16, ['8223', '3639', '9643', '4457', 'q', 'q', '8831', '3521', 'h', 'H', 'C', '3965', 'a', '1559', 'u', '9189', '5355', 'u', 'h', 'y', 'D', 'p', 'S']
[EX A]: 14713

[EX Q]: 1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']
[EX A]: 0

[EX Q]: 3, 13, ['5951', '4661', '8459', 'u', '4247', 'v', '2697', 'k', 'L', 'L', '6773', 'V', 'a']
[EX A]:
22176