1106

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
const int maxn = 100010;
vector<int> child[maxn];
int n;
double p,r;
int minh = maxn,num = 0;
void dfs(int v,int h)
{
	if(child[v].size() == 0)
	{
		if(h < minh)
		{
			minh = h;
			num = 1;
		}
		else if(h == minh)
		{
			num++;
		} 
		return ;
	}
	
	for(int i = 0; i < child[v].size(); i++)
	{
		dfs(child[v][i],h+1);
	}
}
int main()
{
	int u,k,v;
	scanf("%d %lf %lf",&n,&p,&r);
	r /= 100;
	for(int i = 0; i < n; i++)
	{
		scanf("%d",&k);
		if(k != 0)
		{
			for(int j = 0; j < k; j++)
			{
				scanf("%d",&v);
				child[i].push_back(v);
			}
		}
	}
	dfs(0,0);
	printf("%.4f %d",p * pow((1+r),minh),num);
	
	return 0;
}