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

#F2059. Martian Dollar

    ID: 2065 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 3 上传者: 标签>枚举算法思想基础难度共享题库Codeforces英文题面题目来源题面语言

Martian Dollar

题目描述

B. Martian Dollar
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

One day Vasya got hold of information on the Martian dollar course in bourles for the next n days. The buying prices and the selling prices for one dollar on day i are the same and are equal to ai. Vasya has b bourles. He can buy a certain number of dollars and then sell it no more than once in n days. According to Martian laws, one can buy only an integer number of dollars. Which maximal sum of money in bourles can Vasya get by the end of day n?

Input

The first line contains two integers n and b (1≤n,b≤2000) − the number of days and the initial number of money in bourles. The next line contains n integers ai (1≤ai≤2000) − the prices of Martian dollars.

Output

Print the single number − which maximal sum of money in bourles can Vasya get by the end of day n.

Examples
Input
2 4
3 7
Output
8
Input
4 10
4 3 2 1
Output
10
Input
4 10
4 2 3 1
Output
15

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