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:
3, 13, ['7259', '131', '4039', 'b', '9015', '9573', '8473', 'O', 's', '6851', 'N', 'E', '715', 'k', 'j', 'r', '9679', '9519', '5335', '383', 'A', 'd']

Ex Output:
38666


Ex Input:
3, 4, ['v', 't', '4357', '1303']

Ex Output:
5660


Ex Input:
8, 17, ['Y', '8051', 'X', 'j', '7345', '7435', '1367', '2367', '5821', '2277', 'N', 'R', 'Y', '1973', 'U', '2243', '9547']

Ex Output:

24228