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.

Input: Consider Input: 2, 9, ['5655', '7555', 'T', '3387', 'G', '9547', 'Z', '8679', '1561', 'E', '469']

Output: 30729


Input: Consider Input: 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']

Output: 8094


Input: Consider Input: 9, 10, ['7593', '3573', 'o', '5457', '4769', '6921', '1905', 'r', '8267', '4037', 'D', '7685', '8385', 'L', '581', 'B', '9739', 'T', 'Z', '8661']


Output: 12304