B"You are given an array a of length n and array b of length m both consisting of only integers 0 and 1 . Consider a matrix c of size n x m formed by following rule: c_{i, j} = a_i cdot b_j (i.e. a_i multiplied by b_j ). It's easy to see that c consists of only zeroes and ones too. How many subrectangles of size (area) k consisting only of ones are there in c ? A subrectangle is an intersection of a consecutive (subsequent) segment of rows and a consecutive (subsequent) segment of columns. I.e. consider four integers x_1, x_2, y_1, y_2 ( 1 <= x_1 <= x_2 <= n , 1 <= y_1 <= y_2 <= m ) a subrectangle c[x_1 ... x_2][y_1 ... y_2] is an intersection of the rows x_1, x_1+1, x_1+2, ... , x_2 and the columns y_1, y_1+1, y_1+2, ... , y_2 . The size (area) of a subrectangle is the total number of cells in it. The first line contains three integers n , m and k ( 1 <= q n, m <= q 40 ,000, 1 <= q k <= q n cdot m ), length of array a , length of array b and required size of subrectangles. The second line contains n integers a_1, a_2, ldots, a_n ( 0 <= q a_i <= q 1 ), elements of a . The third line contains m integers b_1, b_2, ldots, b_m ( 0 <= q b_i <= q 1 ), elements of b . Output single integer -- the number of subrectangles of c with size (area) k consisting only of ones. In first example matrix c is: There are 4 subrectangles of size 2 consisting of only ones in it: In second example matrix c is: "...