codeforce之problems for round

There are n problems prepared for the next Codeforces round. They are arranged in ascending order by their difficulty, and no two problems have the same difficulty. Moreover, there are m pairs of similar problems. Authors want to split problems between two division according to the following rules:

• Problemset of each division should be non-empty.
• Each problem should be used in exactly one division (yes, it is unusual requirement).
• Each problem used in division 1 should be harder than any problem used in division 2.
• If two problems are similar, they should be used in different divisions.

Your goal is count the number of ways to split problem between two divisions and satisfy all the rules. Two ways to split problems are considered to be different if there is at least one problem that belongs to division 1 in one of them and to division 2 in the other.

Note, that the relation of similarity is not transitive. That is, if problem i is similar to problem j and problem j is similar to problem k, it doesn't follow that i is similar to k.

Input

The first line of the input contains two integers n and m (2 ≤ n ≤ 100 0000 ≤ m ≤ 100 000) — the number of problems prepared for the round and the number of pairs of similar problems, respectively.

Each of the following m lines contains a pair of similar problems ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi). It's guaranteed, that no pair of problems meets twice in the input.

Output

Print one integer — the number of ways to split problems in two divisions.

• 本文已收录于以下专栏：

Codeforces 673B Problems for Round【思维】

B. Problems for Round time limit per test 2 seconds memory limit per test 256 megabytes i...

Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition) B.Problems for Round

B. Problems for Round time limit per test 2 seconds memory limit per test 256 megabytes ...

codeforce ： Educational Codeforces Round 22

A. The Contest 题目大意： 输入一个整数n表示有n个数，然后输入n个数表示这小子解决每个题所用的时间，当然同一时间只能想一个问题，然后他得交题，然后输入m，然后输入m个有序对，表示m...

Codeforces Round #128 (Div. 2) A. Two Problems

A. Two Problems time limit per test 2 seconds memory limit per test 256 megabytes input standa...

codeforce round412 div2 C sucess rate 数学|二分

• Na_OH
• 2017年05月09日 16:21
• 232

codeforce round#411div2

Codeforces Round #411 (Div. 2) A. Fake NP time limit per test 1 second memory limit per t...
• Jamence
• 2017年05月06日 10:11
• 453

【CodeForce】Codeforces Round #141 (Div. 2) B. Two Tables

举报原因： 您举报文章：codeforce之problems for round 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)