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: 11, 20, ['8031', 'v', 'p', '4015', 'v', '3299', '4143', '445', 'I', 'L', 'm', 'u', '7963', '8085', 'c', 'k', 'I', 'A', '8433', '1897', 'g', 'x', '5935', '5195', 'W', 'j', 'A']

Output: 26378


Input: Consider Input: 4, 10, ['B', 'b', '6741', '9121', 'N', '2871', 'Z', '1685', '995', '8681', '8591', 'z', '7423', '8661', 'R', 'b', 'g', 'Z', '5679', '4217', 'h', '8497', '3261', '6891', '2145', 'Y']

Output: 23353


Input: Consider Input: 11, 12, ['O', '8037', 'X', '8965', '5251', 'Z', 'k', '4737', '673', 'A', 'Y', '8663', '4139', '7731', '5509', '6441', '8445', 'm']


Output: 8663