0 人解决，2 人已尝试。
0 份提交通过，共有 18 份提交。
9.9 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
To open sesame one needs a set of tokens containing at least z gold tokens, s silver tokens and m copper tokens.
Initially, Ali Baba has at his disposal a certain number of tokens of each kind. He can exchange them with the Guardian of sesame, according to given rules.
Every rule is of the form:
z1, s1, m1 -> z2, s2, m2 (zi, si, mi are from the set {0,1,2,3,4}).
Such a rule denotes that Ali Baba can exchange z1 gold tokens, s1 silver tokens and m1 copper tokens for z2 gold tokens, s2 silver tokens and m2 copper tokens.
Tokens received in a transaction can be exchanged in the next transactions.
Write a program that:
@ the number of gold, silver and copper tokens owned by Ali Baba initially; @ the description of the set of tokens needed to open sesame; @ the rules of transactions;
In the first line there is one positive integer d<=10, which is the number of sets of data.
Then the sets of data follow. Each set of data consists of many lines.
In the first line there are three non-negative integers zp, sp, mp from the set {0,1,2,3,4}. They are the numbers of gold, silver and copper tokens respectively, owned by Ali Baba initially.
In the second line there are three integers z, s, m from the set {0,1,2,3,4}. They are the numbers of gold, silver and copper tokens needed to open sesame.
In the third line there is written the number of rules r, 1<=r<=10.
In each of the following r lines there is a sequence of six numbers z1, s1, m1, z2, s2, m2 from the set {0,1,2,3,4}. They describe a single rule: z1, s1, m1 -> z2, s2, m2.
The numbers in each line are separated by single spaces.
In the i-th line there should be written the result for the i-th set of data:
one non-negative integer, i.e. the minimal number of transactions that Ali Baba has to carry out in order to receive the set of tokens opening sesame,
or the word NIE (which means NO in Polish).
2 2 2 2 3 3 3 3 0 1 1 2 0 0 1 0 1 0 2 0 1 1 0 0 0 2 1 1 1 2 2 2 4 1 0 0 0 1 0 0 1 0 0 0 1 0 0 1 1 0 0 2 0 0 0 2 2
NIE 9
0 人解决，2 人已尝试。
0 份提交通过，共有 18 份提交。
9.9 EMB 奖励。