【April Fools Day Contest 2016G】【2种语言实现】You're a Professional

G. You're a Professional

time limit per test

2 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

A simple recommendation system would recommend a user things liked by a certain number of their friends. In this problem you will implement part of such a system.

You are given user's friends' opinions about a list of items. You are also given a threshold T — the minimal number of "likes" necessary for an item to be recommended to the user.

Output the number of items in the list liked by at least T of user's friends.

Input

The first line of the input will contain three space-separated integers: the number of friends F (1 ≤ F ≤ 10), the number of items I(1 ≤ I ≤ 10) and the threshold T (1 ≤ T ≤ F).

The following F lines of input contain user's friends' opinions. j-th character of i-th line is 'Y' if i-th friend likes j-th item, and 'N' otherwise.

Output

Output an integer — the number of items liked by at least T of user's friends.

Examples

input

3 3 2
YYY
NNN
YNY

output

2

input

4 4 1
NNNY
NNYN
NYNN
YNNN

output

4

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<ctype.h>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<bitset>
#include<algorithm>
#include<time.h>
using namespace std;
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }
#define MS(x,y) memset(x,y,sizeof(x))
#define MC(x,y) memcpy(x,y,sizeof(x))
#define MP(x,y) make_pair(x,y)
#define ls o<<1
#define rs o<<1|1
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
template <class T1, class T2>inline void gmax(T1 &a, T2 b) { if (b>a)a = b; }
template <class T1, class T2>inline void gmin(T1 &a, T2 b) { if (b<a)a = b; }
const int N = 0, M = 0, Z = 1e9 + 7, ms63 = 0x3f3f3f3f;
int F, I, T;
char a[24][24];
int main()
{
	while (~scanf("%d%d%d", &F,&I,&T))
	{
		for (int i = 1; i <= F; ++i)scanf("%s", a[i]);
		int kitten = 0;
		for (int j = 0; j < I; ++j)
		{
			int tmp = 0;
			for (int i = 1; i<=F; ++i)if (a[i][j] == 'Y')++tmp;
			if (tmp >= T)++kitten;
		}
		printf("%d\n", kitten);
	}
	return 0;
}
/*import java.util.*; public class Main
{
	static Scanner cin = new Scanner(System.in); public static void main(String[] args) { int F = cin.nextInt(); int I = cin.nextInt(); int T = cin.nextInt(); String a[] = new String[20]; for (int i = 1; i <= F; ++i) { a[i] = cin.next(); }int kitten = 0; for (int j = 0; j<I; ++j) { int t = 0; for (int i = 1; i <= F; ++i)if (a[i].charAt(j) == 'Y')++t; if (t >= T)++kitten; }System.out.println(kitten); }
}*/