#include <bits/stdc++.h>
using namespace std;
long long int p4[] = {-1, 1, 0, 0};
long long int q4[] = {0, 0, 1, -1};
long long int p8[] = {-1, 1, 0, 0, -1, 1, -1, 1};
long long int q8[] = {0, 0, 1, -1, 1, 1, -1, -1};
long long int gcd(long long int a, long long int b) {
  if (b > a) gcd(b, a);
  return ((b == 0) ? a : gcd(b, a % b));
}
long long int lcm(long long int a, long long int b) {
  long long int p = (a * b) / (gcd(a, b));
  return p;
}
long long int BigMod(long long int a, long long int b, long long int m) {
  if (!b) return 1;
  long long int ans = BigMod(a, b / 2, m);
  ans = (ans * ans) % m;
  if (b & 1) ans = (ans * a) % m;
  return ans;
}
long long int Mod_inv(long long int a, long long int m) {
  return BigMod(a, m - 2, m);
}
long long int sum(long long int a, long long int b, long long int m) {
  return a >= m - b ? a - (m - b) : a + b;
}
long long int multiply(long long int a, long long int b, long long int m) {
  long long int ans = 0;
  if (b > a) swap(a, b);
  while (b) {
    if (b & 1) ans = sum(ans, a, m);
    b >>= 1;
    a = sum(a, a, m);
  }
  return ans;
}
string s, s1, s2;
int main() {
  long long int i, j, k;
  double l, m, n, c, d, p, q, r;
  long long int cs = 0, tc, t = 1, flg, f, sm;
  cin >> tc;
  cin >> n;
  c = 1234567896326526.0;
  while (tc--) {
    cin >> p >> q;
    d = p / q;
    d *= n;
    c = min(d, c);
  }
  cout << fixed << setprecision(12) << c << endl;
  return 0;
}
