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:
1, 5, ['V', '9481', '9901', '7235', '5281', '2719']

Ex Output:
31898


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:
1, 8, ['3787', 'Q', '6225', '7615', '5135', 'c', '1197', '7743', '7813', 'O', '1829', 'M', 'J', 'J', '6577', '2475', '4515', '5305', 'p', '7589', '7077', 'i', 'Q', '3945', '6873', '8677']

Ex Output:

31702