Alarm Clocks Everywhere

## 题目描述 ```Ivan``` 要睡觉了！他决定先设置自己的闹钟，因为明天有许多必要的 $n$ 个活动要参加。第 $i$ 个活动将在 $x_i$ 分钟开始。```Ivan``` 不想错过任何活动，所以 ```Ivan``` 的闹钟必须在 $x_1,x_2,x_3...x_n$ 分钟都响一次，这样他才不会赖床。（然而闹钟在没有活动的时候响起是允许的） ```Ivan``` 需要为他的闹钟选择两个参数。$y$ 表示闹钟最初开始响铃的时间 ，$p$ 表示闹钟响铃的间隔。 闹钟参数设置好之后，他的闹钟会在 $y ,y+p,y+2p,y+3p...$分钟响起。 ```Ivan``` 可以随意设置 $y$ ，但他不能随意设置 $p$ ，因为生产厂家给定了只有 $m$ 种 $p$，即 $p_1 ,p_2,p_3...,p_m$ 所以 ```Ivan``` 需要找到两个参数 $y ,p_j$ ，使得闹钟的响铃时间包含 $x_1,x_2,x_3...x_n$ 的所有时间点。而你需要输出 $y,j$。如果有多种答案，任意输出一种。 ## 输入输出格式 ### 输入格式 第一行 $n,m (2 \leq n \leq 3 \times10^5 ,1\leq m \leq3 \times 10^5)$ 第二行 $n$ 个数，第 $i$ 个数表示 $x_i(1\leq x_i \leq10^{18})$ ，保证输入是递增的 第二行 $m$ 个数，第 $i$ 个数表示 $p_i(1\leq p_i \leq10^{18})$ ### 输出格式 共一行 输出 $y,j$。如果有多种答案，任意输出一种。

Ivan is going to sleep now and wants to set his alarm clock. There will be many necessary events tomorrow, the $ i $ -th of them will start during the $ x_i $ -th minute. Ivan doesn't want to skip any of the events, so he has to set his alarm clock in such a way that it rings during minutes $ x_1, x_2, \dots, x_n $ , so he will be awake during each of these minutes (note that it does not matter if his alarm clock will ring during any other minute). Ivan can choose two properties for the alarm clock — the first minute it will ring (let's denote it as $ y $ ) and the interval between two consecutive signals (let's denote it by $ p $ ). After the clock is set, it will ring during minutes $ y, y + p, y + 2p, y + 3p $ and so on. Ivan can choose any minute as the first one, but he cannot choose any arbitrary value of $ p $ . He has to pick it among the given values $ p_1, p_2, \dots, p_m $ (his phone does not support any other options for this setting). So Ivan has to choose the first minute $ y $ when the alarm clock should start ringing and the interval between two consecutive signals $ p_j $ in such a way that it will ring during all given minutes $ x_1, x_2, \dots, x_n $ (and it does not matter if his alarm clock will ring in any other minutes). Your task is to tell the first minute $ y $ and the index $ j $ such that if Ivan sets his alarm clock with properties $ y $ and $ p_j $ it will ring during all given minutes $ x_1, x_2, \dots, x_n $ or say that it is impossible to choose such values of the given properties. If there are multiple answers, you can print any.

The first line of the input contains two integers $ n $ and $ m $ ( $ 2 \le n \le 3 \cdot 10^5, 1 \le m \le 3 \cdot 10^5 $ ) — the number of events and the number of possible settings for the interval between signals. The second line of the input contains $ n $ integers $ x_1, x_2, \dots, x_n $ ( $ 1 \le x_i \le 10^{18} $ ), where $ x_i $ is the minute when $ i $ -th event starts. It is guaranteed that all $ x_i $ are given in increasing order (i. e. the condition $ x_1 < x_2 < \dots < x_n $ holds). The third line of the input contains $ m $ integers $ p_1, p_2, \dots, p_m $ ( $ 1 \le p_j \le 10^{18} $ ), where $ p_j $ is the $ j $ -th option for the interval between two consecutive signals.

If it's impossible to choose such values $ y $ and $ j $ so all constraints are satisfied, print "NO" in the first line. Otherwise print "YES" in the first line. Then print two integers $ y $ ( $ 1 \le y \le 10^{18} $ ) and $ j $ ( $ 1 \le j \le m $ ) in the second line, where $ y $ is the first minute Ivan's alarm clock should start ringing and $ j $ is the index of the option for the interval between two consecutive signals (options are numbered from $ 1 $ to $ m $ in the order they are given input). These values should be chosen in such a way that the alarm clock will ring during all given minutes $ x_1, x_2, \dots, x_n $ . If there are multiple answers, you can print any.

3 5
3 12 18
2 6 5 3 3

YES
3 4

4 2
1 5 17 19
4 5

NO

4 2
1 5 17 19
2 1

YES
1 1