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, 9, ['5655', '7555', 'T', '3387', 'G', '9547', 'Z', '8679', '1561', 'E', '469']
[EX A]: 30729

[EX Q]: 3, 6, ['x', '7739', '1923', '5829', '2215', 'M', '1901', 'A', '1585', 'W', '2433', '8947', '2217', '7879', 'i', '8543', '7457']
[EX A]: 9967

[EX Q]: 4, 19, ['z', '6043', '8679', 'R', '6341', '5823', '3017', 'a', 'a', 'R', 'd', 'P', '1183', '4369', 'i', '6531', 'x', 'q', '4889', 'Y', 'N', '429']
[EX A]:
32153