}
else
{
queue[end].nowA = 0;
queue[end].nowB = queue[start].nowB + queue[start].nowA;
}
queue[end].method = pourAB;
queue[end].pre = start;
end ++;
}
//如果b不为空且a没有满，才执行从b向a倒。如果b空了或者a已经满了，执行这一步没意义
if (queue[start].nowB != 0 && queue[start].nowA < Ca)
{
if (queue[start].nowB > Ca - queue[start].nowA)
{
queue[end].nowB =queue[start].nowB - Ca + queue[start].nowA;
queue[end].nowA = Ca;
}
else
queue[end].nowB = 0;
queue[end].nowA = queue[start].nowA + queue[start].nowB;
}
queue[end].method = pourBA;
queue[end].pre = start;
end ++;
}
}
output();
}
int main()
{
while (scanf("%d %d %d", &Ca, &Cb, &N) != EOF)
{
bfs();
}
return 0;
}