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]: 5, 13, ['8179', '2435', 'w', '6965', '2003', 'c', '2091', 'w', '225', 's', 'k', '4281', '1931', '3351', 'o', 'f', 'Y', 'm', '8223', 'X', 'H', 'X']
[EX A]: 10531

[EX Q]: 5, 12, ['4439', 'P', 'e', '4929', '2085', 'w', 'C', '5385', '6517', 'w', '6257', '9721']
[EX A]: 29965

[EX Q]: 13, 13, ['8209', '4343', '513', 'o', '2271', 'x', '8017', '9253', 'X', 'R', '9177', 'F', 'F', '6105', 'I', '7969', 'E', 'x', 'a', '903', 'v', '5489', '8605']
[EX A]:
0