Problem: On the Internet shopping site, on the same page as the product that the user is currently viewing, some other products that other users have bought in the past along with the product that they are currently viewing are displayed. It is believed that sales can be increased by presenting products that are considered to be highly relevant.

Similar things can be seen in local supermarkets (such as bread and jam) as a way to place items that are often bought together nearby. Your job is to write a program that will help you devise product placement. This time, I would like to set a certain standard number of times and find a combination of two products for which the number of times bought together is equal to or greater than the standard number of times.

When given the information of the products bought together and the standard number of times, create a program that outputs the combination of the two products bought together more than the standard number of times.



Input

The input is given in the following format.


N F
info1
info2
::
infoN


The first line gives the number of pieces of information N (1 ≤ N ≤ 100) and the reference number F (1 ≤ F ≤ 100) of the items bought together. The following N lines are given information on the products bought together. Information about the products bought together infoi is given in the following format.


M item1 item2 ... itemM


M (1 ≤ M ≤ 10) indicates how many products this information contains. itemj is the name of the item bought in this purchase and is a string of 1 to 30 length consisting of only lowercase letters. The same product is never given in infoi.

Output

The number of combinations of two products bought together more than the reference number of times is output on the first line, and all combinations are output on the second and subsequent lines. However, if there is no combination, nothing is output after the second line.

The output order is as follows after arranging the product names in the combination in the lexicographic order (the order in which the words are arranged in the English-Japanese dictionary).

* Compare the first product names, and the one with the earliest in lexicographic order comes first.
* If they are the same, compare the second product names and the lexicographic order comes first.



Separate product names with a single space, and separate product combinations with a single line break.

Examples

Input

5 2
3 bread milk banana
2 milk cornflakes
3 potato bread milk
4 cornflakes bread milk butter
2 potato bread


Output

3
bread milk
bread potato
cornflakes milk


Input

5 5
3 bread milk banana
2 milk cornflakes
3 potato bread milk
4 cornflakes bread milk butter
2 potato bread


Output

0

Solution (in CPP):

Solution:
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<string>
using namespace std;
struct DOBERMAN{
char c[61],s[61];
int g;
};
DOBERMAN doberman[1000000]={0},q[1000000]={0},t;
int main(){
int i,j,n,f,m,u=0,o=0,r,l,b=0,jc,jk,js;
static int p[1000000]={0};
char d[61][61];
scanf("%d%d",&n,&f);
for(i=0;i<n;i++){
	scanf("%d",&m);
	for(j=0;j<m;j++){
		cin>>d[j];
	}
	for(j=0;j<m;j++){
		for(r=j+1;r<m;r++){
			o=0;
			//printf("%s %s\n",d[j],d[r]);
			for(l=0;l<u;l++){
				if((strcmp(d[j],doberman[l].c)==0&&strcmp(d[r],doberman[l].s)==0)||(strcmp(d[r],doberman[l].c)==0&&strcmp(d[j],doberman[l].s)==0)){
					//printf("%d:%d\n%d:%d\n",strcmp(d[j],doberman[l].c),strcmp(d[r],doberman[l].s),strcmp(d[r],doberman[l].c),strcmp(d[j],doberman[l].s));
					o=1;
					doberman[l].g++;
					if(doberman[l].g>=f&&p[l]==0){
						q[b]=doberman[l];
						p[l]=1;
						b++;
					}
					break;
				}
			}
			if(o==0){
				//printf("MorishitaSHINE\n");
				js=0;
				for(jc=0;jc<min(strlen(d[j]),strlen(d[r]));jc++){
					if(d[j][jc]-'a'>d[r][jc]-'a'){
						js=1;
						break;
					}
					if(d[j][jc]-'a'<d[r][jc]-'a'){
						js=2;
						break;
					}
				}
				if(js==1){
					strcpy(t.c,d[r]);
					strcpy(t.s,d[j]);
					t.g=doberman[u].g+1;
				}
				else{
				strcpy(t.c,d[j]);
				strcpy(t.s,d[r]);
				t.g=doberman[u].g+1;
				}
				doberman[u]=t;
				//printf("%s %s %d\n",doberman[u].c,doberman[u].s,doberman[u].g);
				if(doberman[u].g>=f&&p[u]==0){
					q[b]=doberman[u];
					p[u]=1;
					b++;
				}
				u++;
			}
		}
	}
}
for(i=0;i<b;i++){
	for(j=i+1;j<b;j++){
		js=0;
		for(jc=0;jc<min(strlen(q[i].c),strlen(q[j].c));jc++){
			if(q[i].c[jc]-'a'>q[j].c[jc]-'a'){
				js=1;
				break;
			}
			if(q[i].c[jc]-'a'<q[j].c[jc]-'a'){
				js=2;
				break;
			}
		}
		if(js==0){
		for(jc=0;jc<min(strlen(q[i].s),strlen(q[j].s));jc++){
			if(q[i].s[jc]-'a'>q[j].s[jc]-'a'){
				js=1;
				break;
			}
			if(q[i].s[jc]-'a'<q[j].s[jc]-'a'){
				js=2;
				break;
			}
		}
		}
		if(js==1){
			t=q[i];
			q[i]=q[j];
			q[j]=t;
		}
	}
}
printf("%d\n",b);
for(i=0;i<b;i++){
	cout<<q[i].c<<' '<<q[i].s<<endl;
}
return 0;
}