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 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']

Ex Output:
26378


Ex Input:
6, 16, ['4469', '9515', 'z', '153', '123', '787', '3795', '1737', '6047', 'l', '165', 'C', 'p', '5221', 'M', '4149', 'L']

Ex Output:
21901


Ex Input:
14, 28, ['W', 'o', '4715', '8029', 'X', 'B', 'b', 'P', '7901', 'W', '1235', '8573', 'z', 'X', 'f', 'G', 'm', '3333', '5337', '381', 'C', '9135', '9091', 'M', '5521', 'Z', 'X', 'x']

Ex Output:

32798