#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b) {
    if (b % 2 == 1) {
      ans = (ans * a) % MOD;
    }
    b = b / 2;
    a = (a * a) % MOD;
  }
  return ans;
}
int main() {
  int n, m;
  cin >> n >> m;
  double a, b, res = 0.0;
  for (int i = 0; i < n; i++) {
    cin >> a >> b;
    if (i == 0)
      res = a / b;
    else
      res = min(res, a / b);
  }
  cout << setprecision(8);
  cout << res * m << endl;
}
