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, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']
[EX A]: 10497

[EX Q]: 2, 9, ['5655', '7555', 'T', '3387', 'G', '9547', 'Z', '8679', '1561', 'E', '469']
[EX A]: 30729

[EX Q]: 8, 9, ['C', 'c', '221', '4759', '9947', 'B', 'N', '3807', '9169', '5285', 'X']
[EX A]:
12976