#include <iostream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <set>
#include <unordered_set>
#include <map>
#include <vector>
#include <string>
#include <deque>
#include <queue>
#include <iomanip>

using namespace std;
using ll  = long long;

void solve();

int main(void) {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	solve();
	return 0;
}

void solve() {
	ll n;
	cin >> n;
	ll m;
	cin >> m;
	ll ans  = 0;
	for(int i=0;i<n;i++) {
		string s;
		cin >> s;
		ll r;
		cin >> r;
		bool match = true;
		match = match && r >= 1200;
		match = match && (s[0] == 'x' || s[1] == 'x' || s[2] == 'x' || s[3] == 'x');
		ans += int(match);
	}
	cout << ans;
}