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.

6, 7, ['6635', '1537', 'F', 'h', '7965', 'K', '5231', 'K', '3089']
5231

2, 5, ['4487', '3761', '159', '7459', '6781', '2403', 'S', '3079', '7161']
18160

1, 15, ['w', 'p', '6207', '2835', 'n', 'F', '3869', 'g', 'y', '5445', '9801', 'z', '7893', 'A', 'L', 'u', '2097', 'e', '7025', 'a', '3237', 'y', '591', '9473', '3051', '4205', '9647']

36050