Fraudulent Transaction Identification

In many financial systems, it is important to identify fraudulent transactions quickly. In this problem, you are given a list of transactions. Each transaction is represented by a unique transaction ID and an amount. You are also given a threshold amount (T). A transaction is considered fraudulent if its amount is strictly greater than (T). Your task is to read the input from standard input, identify all fraudulent transactions, sort the transaction IDs in ascending order, and output them. If there are no fraudulent transactions, output the string None.

inputFormat

The input is read from standard input (stdin). The first line contains two space-separated integers: (n) (the number of transactions) and (T) (the threshold amount). The next (n) lines each contain two space-separated integers: the transaction ID and the amount.

outputFormat

Output the transaction IDs of all fraudulent transactions (i.e. those with an amount greater than (T)) in ascending order, separated by a single space. If there are no fraudulent transactions, output None.## sample

5 5000
1 1500
2 6000
3 7000
4 4500
5 500

2 3