#include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[a]; if (a != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///
ll in(int a, int b, int c, int d, int e, int f) {
	return a*d + b*e + c*f;
}
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n, q;
	cin >> n >> q;
	vl x(n), y(n), z(n),r(n),l(n);
	REP(i, n)cin >> x[i] >> y[i] >> z[i] >>r[i] >>l[i];
	int sx, sy, sz, dx, dy, dz;
	REP(i, q) {
		cin >> sx >> sy >> sz >> dx >> dy >> dz;
		int vx = dx - sx, vy = dy - sy, vz = dz - sz;
		ll ans = 0;
		REP(j, n) {
			int a = sx - x[j], b = sy - y[j], c = sz - z[j];
			ll D = in(a, b, c, vx, vy, vz)*in(a, b, c, vx, vy, vz) - in(vx, vy, vz, vx, vy, vz)*(in(a, b, c, a, b, c) - r[j] * r[j]);
			if (D < 0)continue;
			double t1 = (-in(a, b, c, vx, vy, vz) + sqrt(D)) / in(vx, vy, vz, vx, vy, vz), t2 = (-in(a, b, c, vx, vy, vz) - sqrt(D)) / in(vx, vy, vz, vx, vy, vz);
			if ((t1 >= 0 && t1 <= 1) || (t2 >= 0 && t1 <= 1))ans += l[j];
		}
		cout << ans << endl;
	}
	return 0;
}