#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

#define dump(a) (cerr << (#a) << " = " << (a) << endl)

template<class T> inline void chmax(T& a, const T& b) { if(b > a) a = b; }
template<class T> inline void chmin(T& a, const T& b) { if(b < a) a = b; }

template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
	os << '(' << p.first << ", " << p.second << ')';
	return os;
}

template<class Tuple, unsigned Index>
void print_tuple(ostream& os, const Tuple& t) {}

template<class Tuple, unsigned Index, class Type, class... Types>
void print_tuple(ostream& os, const Tuple& t) {
	if(Index > 0) os << ", ";
	os << get<Index>(t);
	print_tuple<Tuple, Index + 1, Types...>(os, t);
}

template<class... Types>
ostream& operator<<(ostream& os, const tuple<Types...>& t) {
	os << '(';
	print_tuple<tuple<Types...>, 0, Types...>(os, t);
	return os << ')';
}

template<class Iterator>
ostream& dump_range(ostream&, Iterator, const Iterator&);

template<typename T>
ostream& operator<<(ostream& os, vector<T> c) {
	return dump_range(os, c.cbegin(), c.cend());
}

template<class Iterator>
ostream& dump_range(ostream& os, Iterator first, const Iterator& last) {
	os << '[';
	for(int i = 0; first != last; ++i, ++first) {
		if(i) os << ", ";
		os << *first;
	}
	return os << ']';
}

const int INF = 0xfffffff;

struct edge {
	int to, cap, rev;
	edge(int t, int c, int r):to(t), cap(c), rev(r){}
};

vector<vector<edge> > G;
vector<int> level;
vector<int> iter;

void init(int V) {
	G.clear();
	G.resize(V);
	level.clear();
	level.resize(V);
	iter.clear();
	iter.resize(V);
}

void add_edge(int from, int to, int cap) {
	G[from].push_back(edge(to, cap, G[to].size()));
	G[to].push_back(edge(from, 0, G[from].size() - 1));
}

void bfs(int s) {
	fill(level.begin(), level.end(), -1);
	queue<int> que;
	level[s] = 0;
	que.push(s);

	while(!que.empty()) {
		const int v = que.front();
		que.pop();

		for(int i = 0; i < G[v].size(); ++i) {
			const edge& e = G[v][i];
			if(e.cap > 0 && level[e.to] < 0) {
				level[e.to] = level[v] + 1;
				que.push(e.to);
			}
		}
	}
}

int dfs(int v, int t, int f) {
	if(v == t)
		return f;

	for(int& i = iter[v]; i < G[v].size(); ++i) {
		edge& e = G[v][i];
		if(e.cap > 0 && level[v] < level[e.to]) {
			const int d = dfs(e.to, t, min(f, e.cap));
			if(d > 0) {
				e.cap -= d;
				G[e.to][e.rev].cap += d;
				return d;
			}
		}
	}

	return 0;
}

int max_flow(int s, int t) {
	int flow = 0;

	for(;;) {
		bfs(s);
		if(level[t] < 0)
			return flow;

		fill(iter.begin(), iter.end(), 0);
		int f;
		while((f = dfs(s, t, INF)) > 0)
			flow += f;
	}
}



typedef complex<double> point;
istream &operator>> (istream &is, point &p) {
	point::value_type x, y;
	is >> x >> y;
	p.real(x);
	p.imag(y);
	return is;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	for(int n, m; cin >> n >> m && n;) {
		init(n + m + 2);
		const int source = n + m;
		const int sink = source + 1;

		vector<int> v(n);
		vector<point> troops(n), bases(m);

		for(int i = 0; i < n; ++i) {
			cin >> troops[i] >> v[i];
			add_edge(source, i, 1);
		}

		for(int i = 0; i < m; ++i) {
			cin >> bases[i];
			add_edge(i + n, sink, 1);
		}

		vector<vector<double>> use_time(n, vector<double>(m));
		for(int i = 0; i < n; ++i) {
			for(int j = 0; j < m; ++j) {
				use_time[i][j] = abs(troops[i] - bases[j]) / v[i];
			}
		}

		double low = 0.0, high = 1e5;
		for(int i = 0; i < 50; ++i) {
			const double middle = (low + high) / 2.0;
			const auto tmp = G;
			for(int i = 0; i < n; ++i) {
				for(int j = 0; j < m; ++j) {
					if(use_time[i][j] <= middle) {
						add_edge(i, j + n, 1);
					}
				}
			}

			if(max_flow(source, sink) == m) {
				high = middle;
			}
			else {
				low = middle;
			}


			G = move(tmp);
		}

		cout << setiosflags(ios::fixed) << setprecision(10) << low << endl;
	}

	return EXIT_SUCCESS;
}

Measured memory_bytes: 1768