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]: 2, 10, ['143', '3769', '197', '3281', '1839', '8009', 'J', '1019', 'Z', 'y', 'M', 'w', '827', '3603', 'r', '6401', '1039']
[EX A]: 18114

[EX Q]: 10, 16, ['Q', '931', 'P', '6777', 'X', '3855', 'i', '1055', 'd', 'p', '7947', 'z', 'X', 'h', 'g', 'w', 'r', 'T']
[EX A]: 7947

[EX Q]: 15, 18, ['c', 'v', 'z', '5045', '9647', '5921', '5431', 'e', 'X', '8959', '8439', '6305', 'W', 'a', 'G', 'C', '1339', 'Q']
[EX A]:
1339