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]: 1, 7, ['7999', '9549', '8299', 't', '9311', '2385', 'B', 'x', '565', 'C', '6531', 'A', '5949', 'H']
[EX A]: 37543

[EX Q]: 4, 13, ['5653', '9869', '5325', '7307', '5513', '2167', '2393', 'p', 'F', '2011', '5431', '2695', 'v', 'p', '3743', 'j', 'y', '5903', '5135', '467', '8443', 'C', 'i', 'w', 'y']
[EX A]: 27517

[EX Q]: 9, 9, ['8633', 'O', 'N', '3323', '1975', '8707', 'c', 'm', '8357', 'A', 'n', '8931', '9021', 'i']
[EX A]:
8357