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, 16, ['T', 'v', '2985', 'F', '8921', 'M', 'F', '4243', 'k', 'x', '435', 'B', '3335', '7613', 'M', '7809', 'q', '4147', 'h', '7523', 'R', '7589', '8795', 'O', 'L', '3371']

Ex Output:
35341

Ex Input:
2, 15, ['4175', '6415', 'U', '8883', 'J', '5843', '3923', '8991', 'P', 'm', 'S', 'T', '5819', 'q', '7405']

Ex Output:
47279

Ex Input:
11, 16, ['U', '1619', 'Q', '4783', '4419', 'U', '6145', '5559', 'q', '95', '909', 'v', '8075', 'i', '3977', '541', '6087', 'G', '6595', '5215', '7617', 'M']

Ex Output:
13502