#include <bits/stdc++.h>   using namespace std;   template <typename T, typename U>   inline void smin(T &a, U b) {     if (a > b) a = b;   }   template <typename T, typename U>   inline void smax(T &a, U b) {     if (a < b) a = b;   }   template <class T>   inline void gn(T &first) {     char c, sg = 0;     while (c = getchar(), (c >  9  || c <  0 ) && c !=  - )       ;     for ((c ==  -  ? sg = 1, c = getchar() : 0), first = 0; c >=  0  && c <=  9 ;          c = getchar())       first = (first << 1) + (first << 3) + c -  0 ;     if (sg) first = -first;   }   template <class T, class T1>   inline void gn(T &first, T1 &second) {     gn(first);     gn(second);   }   template <class T, class T1, class T2>   inline void gn(T &first, T1 &second, T2 &z) {     gn(first);     gn(second);     gn(z);   }   template <class T>   inline void print(T first) {     if (first < 0) {       putchar( - );       return print(-first);     }     if (first < 10) {       putchar( 0  + first);       return;     }     print(first / 10);     putchar(first % 10 +  0 );   }   template <class T>   inline void printsp(T first) {     print(first);     putchar(   );   }   template <class T>   inline void println(T first) {     print(first);     putchar(  n );   }   template <class T, class U>   inline void print(T first, U second) {     printsp(first);     println(second);   }   template <class T, class U, class V>   inline void print(T first, U second, V z) {     printsp(first);     printsp(second);     println(z);   }   int power(int a, int b, int m, int ans = 1) {     for (; b; b >>= 1, a = 1LL * a * a % m)       if (b & 1) ans = 1LL * ans * a % m;     return ans;   }   const int B = 2222222;   int n, u, cnt[B << 1], flag[B];   long long s[B << 1], first, second;   long long calc(int p) {     long long ans = 0;     int r = max(1, p - (int)(first / second));     for (int t = 0; t + p < B; t += p) {       ans += second * ((long long)(cnt[t + p - 1] - cnt[t + r - 1]) * (t + p) -                        s[t + p - 1] + s[t + r - 1]);       ans += first * (cnt[t + r - 1] - cnt[t]);     }     return ans;   }   void solve_B() {     gn(n, first, second);     for (int i = 0; i < n; i++) {       gn(u);       s[u] += u;       cnt[u]++;     }     for (int i = 1; i < B; i++) s[i] += s[i - 1], cnt[i] += cnt[i - 1];     long long ans = n * first;     for (int i = 2; i < B; i++)       if (!flag[i]) {         smin(ans, calc(i));         if ((long long)i * i >= B) continue;         for (int j = i * i; j < B; j += i) flag[j] = 1;       }     println(ans);     exit(0);   }   int main() {     solve_B();     return 0;   }   