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]: 6, 18, ['5051', 'g', 'C', 'p', 'O', 'i', 'E', '4947', '5345', '8453', '4967', '3749', 'F', 'P', '5045', 'o', '5605', 'H', '9319', '5471', 'F', 'B', 't', 'H']
[EX A]: 38111

[EX Q]: 11, 16, ['8617', '6133', '5505', '6601', 'y', 'a', '1019', 'r', 'P', 'd', 'P', '9647', '9831', 'I', 'z', 'k', '749', '8975']
[EX A]: 19478

[EX Q]: 3, 26, ['e', '2985', 'd', 'm', '6179', '53', '9127', '5107', '9951', 'y', 'l', '4413', '5969', 'z', '1443', '1705', '4145', 'Y', '8755', '1893', 'D', '9053', '4591', '2445', '3741', '521', 'V', '3355', 'S']
[EX A]:
79091