#include <bits/stdc++.h>
#define endln '\n'
#define print(x) cout << (x) << endln
using namespace std;
using ll = long long;

int n, q;
map<string, int> ord;
const int maxN = 1005;
long double conversion[maxN][maxN];

void solve()
{
    cin >> n >> q;
    int curInd = 0;
    for (int i = 0; i < n; i++)
    {
        long double amt1;
        string unit1;
        string equals;
        long double amt2;
        string unit2;
        cin >> amt1 >> unit1 >> equals >> amt2 >> unit2;
        if (ord.count(unit1) == 0)
        {
            ord[unit1] = curInd++;
        }

        if (ord.count(unit2) == 0)
        {
            ord[unit2] = curInd++;
        }

        int ind1 = ord[unit1];
        int ind2 = ord[unit2];
        conversion[ind1][ind2] = amt2 / amt1;
        conversion[ind2][ind1] = amt1 / amt2;
    }

    for (int i = 0; i < curInd; i++)
    {
        for (int j = 0; j < curInd; j++)
        {
            for (int k = 0; k < curInd; k++)
            {
                if (conversion[j][k] == 0)
                {
                    if (conversion[j][i] > 0 && conversion[i][k] > 0)
                    {
                        conversion[j][k] = conversion[j][i] * conversion[i][k];
                    }
                }
            }
        }
    }
    cout << setprecision(17);
    while (q--)
    {
        double amt;
        string unit1;
        string to;
        string unit2;
        cin >> amt >> unit1 >> to >> unit2;
        int ind1 = ord[unit1];
        int ind2 = ord[unit2];
        if (conversion[ind1][ind2] > 0)
        {
            print(amt * conversion[ind1][ind2]);
        }
        else
        {
            print("impossible");
        }
    }
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
}