B'You are given two arrays of integers a_1, a_2, ldots, a_n and b_1, b_2, ldots, b_n . You need to handle q queries of the following two types: In this problem gcd(x, y) denotes the greatest common divisor of x and y , and operatorname{lcm}(x, y) denotes the least common multiple of x and y . The first line contains two integers n and q ( 1 <= q n, q <= q 5 cdot 10^4 ) -- the number of numbers in the arrays a and b and the number of queries. The second line contains n integers a_1, a_2, ldots, a_n ( 1 <= q a_i <= q 5 cdot 10^4 ) -- the elements of the array a . The third line contains n integers b_1, b_2, ldots, b_n ( 1 <= q b_i <= q 5 cdot 10^4 ) -- the elements of the array b . Then q lines follow, j -th of which starts with an integer t_j ( 1 <= q t_j <= q 2 ) and means that the j -th query has type t_j . If t_j = 1 , it is followed by three integers l_j , r_j , and x_j ( 1 <= q l_j <= q r_j <= q n , 1 <= q x_j <= q 5 cdot 10^4 ). If t_j = 2 , it is followed by two integers l_j and r_j ( 1 <= q l_j <= q r_j <= q n ). It is guaranteed that there is at least one query of type 2 . For each query of the second type, output the minimum value of the expression. In the first example: In the second: '...