#include<bits/stdc++.h>
using namespace std;
int N,num,temp;
double P, r,minPrice;
bool visited[100007];
vector<int> v[100007];
int minHeight = 999999,sum;
void dfs(int root, int h) {
if (v[root].size() == 0) {
if (h == minHeight) {
sum++;
}
if (h < minHeight) {
minHeight = h;
sum = 1;
}
return;
}
int len = v[root].size();
for (int i = 0; i < len; i++) {
dfs(v[root][i], h + 1);
}
}
int main() {
scanf("%d %lf %lf", &N, &P, &r);
for (int i = 0; i < N; i++) {
scanf("%d", &num);
for (int j = 0; j < num; j++) {
scanf("%d", &temp);
v[i].push_back(temp);
visited[temp] = true;
}
}
int root = 0;
while (visited[root] == true) root++;
dfs(root, 0);
minPrice = P * pow(1 + r / 100, minHeight);
printf("%.4f %d", minPrice, sum);
}