#include<bits/stdc++.h>
using namespace std;
#define int long long
int read(){int x=0;char f=1,ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();return x*f;}
const int N=1e4+10;
struct node{
	string name,s1,s2,s3;
	int id,rk;
	friend bool operator<(const node a,const node b){
		if(a.id!=b.id)
			return a.id<b.id;
		return a.rk<b.rk;
	}
}a[N],b[N];
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	int n,m,t,k;cin>>n>>m>>t>>k;
	for(int i=1;i<=n;++i)
		cin>>a[i].name>>a[i].s1>>a[i].s2>>a[i].s3>>a[i].id>>a[i].rk;
	sort(a+1,a+n+1);
	set<string>s;
	int cnt=0;
	for(int i=1;i<=n&&cnt<k;++i)
		if(s.find(a[i].s1)==s.end()&&s.find(a[i].s2)==s.end()&&s.find(a[i].s3)==s.end()){
			b[++cnt]=a[i];
			s.insert(a[i].s1),s.insert(a[i].s2),s.insert(a[i].s3);
		}
	cout<<cnt<<"\n";
	for(int i=1;i<=cnt;++i)
		cout<<b[i].name<<" "<<b[i].s1<<" "<<b[i].s2<<" "<<b[i].s3<<"\n";
	return 0;
}