跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2292. Vasya and Beautiful Arrays

  • ID: 2298
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:提高
  • 上传者:
  • 枚举
  • 动态规划
  • 数论
  • 算法思想
  • 数学
  • 提高
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Vasya and Beautiful Arrays

题目描述

C. Vasya and Beautiful Arrays
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Vasya's got a birthday coming up and his mom decided to give him an array of positive integers a of length n.

Vasya thinks that an array's beauty is the greatest common divisor of all its elements. His mom, of course, wants to give him as beautiful an array as possible (with largest possible beauty). Unfortunately, the shop has only one array a left. On the plus side, the seller said that he could decrease some numbers in the array (no more than by k for each number).

The seller can obtain array b from array a if the following conditions hold: bi>0; 0≤ai-bi≤k for all 1≤i≤n.

Help mom find the maximum possible beauty of the array she will give to Vasya (that seller can obtain).

Input

The first line contains two integers n and k (1≤n≤3·105;1≤k≤106). The second line contains n integers ai (1≤ai≤106) − array a.

Output

In the single line print a single number − the maximum possible beauty of the resulting array.

Examples
Input
6 1
3 6 10 12 13 16
Output
3
Input
5 3
8 21 52 15 77
Output
7
Note

In the first sample we can obtain the array:

3 6 9 12 12 15

In the second sample we can obtain the next array:

7 21 49 14 77


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1905 题。保留原作者与原赛事署名。