#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int tenIn(short n)
{
	if(n==0)
		return 1;
	int ans = 10;
	n--;
	while(n!=0)
	{
		ans*=10;
		n--;
	}
	return ans;
}
int main()
{
	long long int n,k,t;
	cin>>n>>k>>t;
	string books[n];
	for(int i = 0;i<n;i++)
		cin>>books[i];
	vector<int> nums;
	for(int i = 0;i<n;i++)
	{
		int p=0;
		int c=0;
		bool m=0;
		for(int j = 0;j<7;j++)
		{
			if(!m)
			{
				if(books[i][j]=='-')
				{
					m = 1;
					continue;
				}
				else if(p==0 && books[i][j] == '0')
					continue;
				p+=((int)(books[i][j]-'0'))*tenIn(3 - j - 1);
			}
			else
			{

				if(c==0 && books[i][j] == '0')
					continue;
				c+=((int)(books[i][j]-'0'))*tenIn(6 - j);
			}
		}
		nums.push_back((c*p)/k + (c*p)%k);
	}
	sort(nums.begin(),nums.end());
	long long int summ=0;
	int ans = 0;
	for(int i = 0;i<n;i++)
	{
		if(summ+nums[i]<=t)
		{
			summ+=nums[i];
			ans++;
		}
		else
			break;
	}
	//for VVV
	bool vova;
	cout<<ans;
}