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:
8, 11, ['5059', '2111', 'E', '8681', '5859', '7293', '9627', 'L', 'N', 'n', 'i']

Ex Output:
0


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, 8, ['s', 'X', 'a', 'L', 'N', 'J', '1893', '4909', '349', '7679', '4479', 'i', '7345']

Ex Output:

6802