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, 16, ['4469', '9515', 'z', '153', '123', '787', '3795', '1737', '6047', 'l', '165', 'C', 'p', '5221', 'M', '4149', 'L']
[EX A]: 21901

[EX Q]: 5, 10, ['7435', 'B', '7841', '5901', 'I', '6255', 'g', 'F', 'D', '1839', '3651', 'Q', '1629', 'T', '3423', 'y', '9597', '8453', '8541', 'a', '357', 'k', 'P']
[EX A]: 8094

[EX Q]: 7, 12, ['X', '3485', 'k', '6797', 'L', 'V', '7613', 'W', '3467', '3275', '7961', 'X']
[EX A]:
22316