#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

map<string, int> idx;

int getIdx(const string& s) {
	if (!idx.count(s)) {
		int sz = SZ(idx);
		idx[s] = sz;
	}
	return idx[s];
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << scientific << setprecision(10);
	int n, q;
	cin >> n >> q;
	vector d(2 * n, vector<double>(2 * n, -1));
	FOR(i, 0, 2 * n) {
		d[i][i] = 1;
	}
	FOR(i, 0, n) {
		string one, unit1, equals, unit2;
		double v;
		cin >> one >> unit1 >> equals >> v >> unit2;
		assert(one == "1" && equals == "=");
		int idx1 = getIdx(unit1), idx2 = getIdx(unit2);
		d[idx1][idx2] = v;
		d[idx2][idx1] = 1 / v;
	}
	int m = SZ(idx);
	FOR(k, 0, m) {
		FOR(i, 0, m) {
			FOR(j, 0, m) {
				if (d[i][k] >= 0 && d[k][j] >= 0) {
					d[i][j] = d[i][k] * d[k][j];
				}
			}
		}
	}
	while (q--) {
		double v;
		string unit1, unit2, to;
		cin >> v >> unit1 >> to >> unit2;
		assert(to == "to");
		int idx1 = getIdx(unit1), idx2 = getIdx(unit2);
		if (d[idx1][idx2] < 0) {
			cout << "impossible\n";
		}
		else {
			cout << v * d[idx1][idx2] << "\n";
		}
	}
	return 0;
}