# UTS Programming Competition 2014 Problem 7

### From ProgSoc Wiki

# Problem 7: Dominoes

*Run time limit: 10 seconds*

*Adapted from Problem D, "Dominos", of the ACM Programming Contest, September 27, 2008, University of Waterloo, Canada (http://acm.student.cs.uwaterloo.ca/~acm00/080927/)*

## Problem Description

Dominoes are lots of fun. Children like to stand the tiles on their side in long lines. When one domino falls, it knocks down the next one, which knocks down the one after that, all the way down the line. However, sometimes a domino fails to knock the next one down. In that case, we have to knock it down by hand to get the dominoes falling again.

Your task is to determine, given the layout of some domino tiles, the minimum number of dominoes that must be knocked down by hand in order for all of the dominoes to fall.

## Data Specification

### Input

The first line of input contains one integer specifying the number of test cases to follow. Each test case begins with a line containing two integers, each no larger than 100 000. The first integer n is the number of domino tiles and the second integer m is the number of lines to follow in the test case. The domino tiles are numbered from 1 to n. Each of the following lines contains two integers x and y indicating that if domino number x falls, it will cause domino number y to fall as well.

### Output

For each test case, output a line containing one integer, the minimum number of dominoes that must be knocked over by hand in order for all the dominoes to fall.

### Sample Input

1 3 2 1 2 2 3

### Sample Output

1

## Solutions

Put your solutions here!