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.

Example Input: 1, 2, ['9621', '3231', '5905', 'M', '3233', 'j', '2449', '3805', '4923', '235', '407', 'w']
Example Output: 12852

Example Input: 5, 6, ['M', '4965', '7693', 'g', 'G', '695', '2401', '5715', 'P', '8197']
Example Output: 695

Example Input: 3, 12, ['s', '3943', '2597', 'B', 'J', '8261', 'Y', '2677', 'e', 'P', 'x', 'c', 'x', 's', '2921', '4405', '2957', 'j', '6321', '8577', '1', '1971', 'a', '2697', '9691', 'c', 't']
Example Output:
13535