Pangram Check

A pangram contains every English letter at least once. Determine whether the text is a pangram. Ignore case, spaces, digits, and punctuation.

Implement pangram_check(text).

Input

text: The text to inspect.

Output

Return true if all 26 letters appear, otherwise false.

Constraints

0 ≤ text length ≤ 100,000. Input contains printable ASCII characters. Only letters A–Z and a–z count.

Examples

Input:
text = "The quick brown fox jumps over the lazy dog."

Expected output:
expected = True

Input:
std::string text = "The quick brown fox jumps over the lazy dog.";

Expected output:
bool expected = true;

Input:
string text = "The quick brown fox jumps over the lazy dog.";

Expected output:
bool expected = true;

Input:
text = "abcdefghijklmnopqrstuvwxy"

Expected output:
expected = False

Input:
std::string text = "abcdefghijklmnopqrstuvwxy";

Expected output:
bool expected = false;

Input:
string text = "abcdefghijklmnopqrstuvwxy";

Expected output:
bool expected = false;

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

• Exercism: Pangram