CF1103D.Professional layer

Cardbluff is popular sport game in Telegram. Each Cardbluff player has ever dreamed about entrance in the professional layer. There are $n$ judges now in the layer and you are trying to pass the entrance exam. You have a number $k$ — your skill in Cardbluff.

Each judge has a number $a_i$ — an indicator of uncertainty about your entrance to the professional layer and a number $e_i$ — an experience playing Cardbluff. To pass the exam you need to convince all judges by playing with them. You can play only one game with each judge. As a result of a particular game, you can divide the uncertainty of $i$-th judge by any natural divisor of $a_i$ which is at most $k$. If GCD of all indicators is equal to $1$, you will enter to the professional layer and become a judge.

Also, you want to minimize the total amount of spent time. So, if you play with $x$ judges with total experience $y$ you will spend $x \cdot y$ seconds.

Print minimal time to enter to the professional layer or $-1$ if it's impossible.

Cardbluff 是 Telegram 上一项流行的体育游戏。每位 Cardbluff 玩家都曾梦想进入职业圈。目前职业圈内共有 $n$ 位评委，而你正试图通过入圈考试。你拥有一个数值 $k$ —— 表示你在 Cardbluff 方面的技能水平。

每位评委 $i$ 拥有两个数值：$a_i$（表示其对你能否进入职业圈所持的不确定性指标）和 $e_i$（表示其玩 Cardbluff 的经验）。要通过考试，你必须通过与每位评委对战来说服他们。你只能与每位评委进行一局游戏。在与第 $i$ 位评委的对局中，你可以将该评委的不确定性 $a_i$ 除以 $a_i$ 的任意一个不超过 $k$ 的正整数因子（即：若 $d \mid a_i$ 且 $1 \le d \le k$，则可将 $a_i$ 替换为 $a_i / d$）。当所有评委的不确定性指标的最大公约数（GCD）等于 1 时，你便成功进入职业圈，并成为一名评委。

此外，你还希望最小化总耗时。具体而言：若你与 $x$ 位评委对战，这些评委的经验值之和为 $y$，则你总共将花费 $x \cdot y$ 秒。

请输出进入职业圈所需的最短时间；若不可能实现，则输出 $-1$。

There are two numbers in the first line $n$ and $k$ ($1 \leq n \leq 10^6$, $1 \leq k \leq 10^{12}$) — the number of judges and your skill in Cardbluff.

The second line contains $n$ integers, where $i$-th number $a_i$ ($1 \leq a_i \leq 10^{12}$) — the uncertainty of $i$-th judge

The third line contains $n$ integers in the same format ($1 \leq e_i \leq 10^9$), $e_i$ — the experience of $i$-th judge.

第一行包含两个整数 $n$ 和 $k$（$1 \leq n \leq 10^6$，$1 \leq k \leq 10^{12}$）—— 分别表示评委人数和你在“卡牌虚张声势”（Cardbluff）游戏中的技能值。

第二行包含 $n$ 个整数，其中第 $i$ 个数 $a_i$（$1 \leq a_i \leq 10^{12}$）表示第 $i$ 位评委的不确定性。

第三行同样包含 $n$ 个整数（$1 \leq e_i \leq 10^9$），其中 $e_i$ 表示第 $i$ 位评委的经验值。

Print the single integer — minimal number of seconds to pass exam, or $-1$ if it's impossible

输出一个整数——通过考试所需的最少秒数；若无法通过考试，则输出 $-1$