title
stringlengths 1
186
| sub_title
stringlengths 0
459
| contents
stringlengths 1
16.2k
| id
stringlengths 6
13
|
|---|---|---|---|
Mondegreen | In literature | "A Monk Swimming" by author Malachy McCourt is so titled because of a childhood mishearing of a phrase from the Catholic rosary prayer, Hail Mary. "Amongst women" became "a monk swimmin'". The title and plot of the short science fiction story "Come You Nigh: Kay Shuns" ("Com-mu-ni-ca-tions") by Lawrence A. Perkins, in "Analog Science Fiction and Fact" magazine (April 1970), deals with securing interplanetary radio communications by encoding them with mondegreens. "Olive, the Other Reindeer" is a 1997 children's book by Vivian Walsh, which borrows its title from a mondegreen of the line, "all of the other reindeer" in the song "Rudolph the Red-Nosed Reindeer". | wiki:25699901 |
Mondegreen | In literature | The book was adapted into an animated Christmas special in 1999. | wiki:25699902 |
Mondegreen | In film | A monologue of mondegreens appears in the 1971 film "Carnal Knowledge". The camera focuses on actress Candice Bergen laughing as she recounts various phrases that fooled her as a child, including "Round John Virgin" (instead of '"Round yon virgin...") and "Gladly, the cross-eyed bear" (instead of “Gladly the cross I’d bear”). The title of the 2013 film "Ain't Them Bodies Saints" is a misheard lyric from a folk song; director David Lowery decided to use it because it evoked the "classical, regional" feel of 1970s rural Texas. | wiki:25699903 |
Mondegreen | In television | Mondegreens have been used in many television advertising campaigns, including: | wiki:25699904 |
Mondegreen | Other notable examples | The traditional game Chinese whispers ("Telephone" in North America) involves mishearing a whispered sentence to produce successive mondegreens that gradually distort the original sentence as it is repeated by successive listeners. Among schoolchildren in the U.S., daily rote recitation of the Pledge of Allegiance has long provided opportunities for the genesis of mondegreens. | wiki:25699905 |
Mondegreen | Dutch | In Dutch, mondegreens are popularly referred to as "Mama appelsap" ("Mommy applejuice"), from the Michael Jackson song "Wanna Be Startin' Somethin'" which features the lyrics "Mama-se mama-sa ma-ma-coo-sa", and was once misheard as "Mama say mama sa mam[a]appelsap". The Dutch radio station 3FM had a show "Superrradio" (originally "Timur Open Radio") run by Timur Perlin and Ramon with an item in which listeners were encouraged to send in mondegreens under the name "Mama appelsap". The segment was popular for years. | wiki:25699906 |
Mondegreen | French | In French, the phenomenon is also known as 'hallucination auditive', especially when referring to pop songs. The title of the film "La Vie en rose" depicting the life of Édith Piaf can be mistaken for "L'Avion rose" (The pink airplane). The title of the 1983 French novel "Le Thé au harem d'Archi Ahmed" ("Tea in the Harem of Archi Ahmed") by Mehdi Charef (and the 1985 movie of the same name) is based on the main character mishearing "le théorème d'Archimède" ("the theorem of Archimedes") in his mathematics class. | wiki:25699907 |
Mondegreen | German | Mondegreens are a well-known phenomenon in German, especially where non-German songs are concerned. They are sometimes called, after a well-known example, "Agathe Bauer"-songs ("I got the power", a song by Snap!, transferred to a German female name). Journalist Axel Hacke published a series of books about them, beginning with "Der weiße Neger Wumbaba" ("The White Negro Wumbaba", after the line "der weiße Nebel wunderbar" from Der Mond ist aufgegangen). In urban legend, children's paintings of nativity scenes, occasionally include next to the Child, Mary, Joseph and so on, an additional, laughing creature known as the "Owi". The reason is to be found in the line "Gottes Sohn! O wie lacht / Lieb' aus Deinem göttlichen Mund" (God's Son! Oh, how does love laugh out of Thy divine mouth!) from Silent Night. | wiki:25699908 |
Mondegreen | German | The subject is "Lieb", a poetic contraction of "die Liebe" leaving off the final -e and the definite article, so that the phrase might be misunderstood as being about a person named "Owi" laughing "in a loveable manner". "Owi lacht" is the title of at least one book about Christmas and Christmas songs. | wiki:25699909 |
Mondegreen | Hebrew | An Israeli site dedicated to Hebrew mondegreens has coined the term "avatiach" (Hebrew for watermelon) for "mondegreen", named for a common mishearing of Shlomo Artzi's award-winning 1970 song "Ahavtia" ("I loved her", using a form uncommon in spoken Hebrew). | wiki:25699910 |
Mondegreen | Polish | A paper in phonology cites memoirs of the poet Antoni Słonimski, who confessed that in the recited poem "Konrad Wallenrod" he used to hear "zwierz Alpuhary" ("a beast of Alpujarras") rather than "z wież Alpuhary" ("from the towers of Alpujarras"). | wiki:25699911 |
Mondegreen | Portuguese | The most well-known mondegreen in Brazil is in the song "Noite do Prazer" (Night of Pleasure) by Claudio Zoli: the line "Na madrugada a vitrola rolando um blues, tocando B. B. King sem parar" (At dawn the phonograph playing blues, playing B. B. King nonstop), is often misheard as "Na madrugada a vitrola rolando um blues, trocando de biquini sem parar" (at dawn the phonograph playing blues, changing bikinis nonstop). | wiki:25699912 |
Mondegreen | Russian | In 1875 Fyodor Dostoyevsky cited a line from Fyodor Glinka's song "Troika" (1825) "колокольчик, дар Валдая" ("the bell, gift of Valday"), stating that it is usually understood as "колокольчик, дарвалдая" ("the bell "darvaldaying""—supposedly an onomatopoeia of ringing). | wiki:25699913 |
Mondegreen | Reverse mondegreen | A reverse mondegreen is the intentional production, in speech or writing, of words or phrases that seem to be gibberish but disguise meaning. A prominent example is "Mairzy Doats", a 1943 novelty song by Milton Drake, Al Hoffman, and Jerry Livingston. The lyrics are a reverse mondegreen, made up of same-sounding words or phrases (sometimes also referred to as "oronyms"), so pronounced (and written) as to challenge the listener (or reader) to interpret them: The clue to the meaning is contained in the bridge: This makes it clear that the last line is "A kid'll eat ivy, too; wouldn't you?" | wiki:25699914 |
Mondegreen | Deliberate mondegreen | Two authors have written books of supposed foreign-language poetry that are actually mondegreens of nursery rhymes in English. Luis van Rooten's pseudo-French "" includes critical, historical, and interpretive apparatus, as does John Hulme's "Mörder Guss Reims", attributed to a fictitious German poet. Both titles sound like the phrase "Mother Goose Rhymes". Both works can also be considered soramimi, which produces different meanings when interpreted in another language. Wolfgang Amadeus Mozart produced a similar effect in his canon "Difficile Lectu", which, though ostensibly in Latin, is actually an opportunity for scatological humor in both German and Italian. Some performers and writers have used deliberate mondegreens to create double entendres. | wiki:25699915 |
Mondegreen | Deliberate mondegreen | The phrase "if you see Kay" (F-U-C-K) has been employed many times, notably as a line from James Joyce's 1922 novel "Ulysses" and in many songs, including by blues pianist Memphis Slim in 1963, R. Stevie Moore in 1977, April Wine on its 1982 album "Power Play", the Poster Children via their "Daisy Chain Reaction" in 1991, Turbonegro in 2005, Aerosmith in "Devil's Got a New Disguise" in 2006, and The Script in their 2008 song "If You See Kay". Britney Spears did the same thing with the song "If U Seek Amy". A similar effect was created in Hindi in the 2011 Bollywood movie "Delhi Belly" in the song "Bhaag D.K. | wiki:25699916 |
Mondegreen | Deliberate mondegreen | Bose". While "D. K. Bose" appears to be a person's name, it is sung repeatedly in the chorus to form the deliberate mondegreen ""bhosadi ke"" (Hindi: भोसडी के), a Hindi expletive. "Mondegreen" is a song by Yeasayer on their 2010 album, "Odd Blood". The lyrics are intentionally obscure (for instance, "Everybody sugar in my bed" and "Perhaps the pollen in the air turns us into a stapler") and spoken hastily to encourage the mondegreen effect. | wiki:25699917 |
Mondegreen | Related linguistic phenomena | Closely related categories are Hobson-Jobson, where a word from a foreign language is homophonically translated into one's own language, e.g. "cockroach" from Spanish "cucaracha", and "soramimi", a Japanese term for homophonic translation of song lyrics. An unintentionally incorrect use of similar-sounding words or phrases, resulting in a changed meaning, is a malapropism. If there is a connection in meaning, it may be called an eggcorn. If a person stubbornly continues to mispronounce a word or phrase after being corrected, that person has committed a mumpsimus. | wiki:25699918 |
Merge sort | Introduction | In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the order of equal elements is the same in the input and output. Merge sort is a divide and conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of bottom-up mergesort appeared in a report by Goldstine and von Neumann as early as 1948. | wiki:25699919 |
Merge sort | Top-down implementation | Example C-like code using indices for top-down merge sort algorithm that recursively splits the list (called "runs" in this example) into sublists until sublist size is 1, then merges those sublists to produce a sorted list. The copy back step is avoided with alternating the direction of the merge with each level of recursion (except for an initial one time copy). To help understand this, consider an array with 2 elements. The elements are copied to B[], then merged back to A[]. If there are 4 elements, when the bottom of recursion level is reached, single element runs from A[] are merged to B[], and then at the next higher level of recursion, those 2 element runs are merged to A[]. | wiki:25699920 |
Merge sort | Top-down implementation | This pattern continues with each level of recursion. // Array A[] has the items to sort; array B[] is a work array. void TopDownMergeSort(A[], B[], n) // Sort the given run of array A[] using array B[] as a source. // iBegin is inclusive; iEnd is exclusive (A[iEnd] is not in the set). void TopDownSplitMerge(B[], iBegin, iEnd, A[]) // Left source half is A[ iBegin:iMiddle-1]. // Right source half is A[iMiddle:iEnd-1 ]. // Result is B[ iBegin:iEnd-1 ]. void TopDownMerge(A[], iBegin, iMiddle, iEnd, B[]) | wiki:25699921 |
Merge sort | Bottom-up implementation | Example C-like code using indices for bottom-up merge sort algorithm which treats the list as an array of "n" sublists (called "runs" in this example) of size 1, and iteratively merges sub-lists back and forth between two buffers: // array A[] has the items to sort; array B[] is a work array void BottomUpMergeSort(A[], B[], n) // Left run is A[iLeft :iRight-1]. // Right run is A[iRight:iEnd-1 ]. void BottomUpMerge(A[], iLeft, iRight, iEnd, B[]) void CopyArray(B[], A[], n) | wiki:25699922 |
Merge sort | Top-down implementation using lists | Pseudocode for top-down merge sort algorithm which recursively divides the input list into smaller sublists until the sublists are trivially sorted, and then merges the sublists while returning up the call chain. In this example, the function merges the left and right sublists. | wiki:25699923 |
Merge sort | Bottom-up implementation using lists | Pseudocode for bottom-up merge sort algorithm which uses a small fixed size array of references to nodes, where array[i] is either a reference to a list of size 2 or "nil". "node" is a reference or pointer to a node. The merge() function would be similar to the one shown in the top-down merge lists example, it merges two already sorted lists, and handles empty lists. In this case, merge() would use "node" for its input parameters and return value. | wiki:25699924 |
Merge sort | Natural merge sort | A natural merge sort is similar to a bottom-up merge sort except that any naturally occurring runs (sorted sequences) in the input are exploited. Both monotonic and bitonic (alternating up/down) runs may be exploited, with lists (or equivalently tapes or files) being convenient data structures (used as FIFO queues or LIFO stacks). In the bottom-up merge sort, the starting point assumes each run is one item long. In practice, random input data will have many short runs that just happen to be sorted. In the typical case, the natural merge sort may not need as many passes because there are fewer runs to merge. | wiki:25699925 |
Merge sort | Natural merge sort | In the best case, the input is already sorted (i.e., is one run), so the natural merge sort need only make one pass through the data. In many practical cases, long natural runs are present, and for that reason natural merge sort is exploited as the key component of Timsort. Example: Tournament replacement selection sorts are used to gather the initial runs for external sorting algorithms. | wiki:25699926 |
Merge sort | Analysis | Firstly, each processor sorts the assigned formula_59 elements locally using a sorting algorithm with complexity formula_60. After that, the splitter elements have to be calculated in time formula_61. Finally, each group of formula_9 splits have to be merged in parallel by each processor with a running time of formula_63 using a sequential p-way merge algorithm. Thus, the overall running time is given by formula_64. | wiki:25699927 |
Merge sort | Variants | Variants of merge sort are primarily concerned with reducing the space complexity and the cost of copying. A simple alternative for reducing the space overhead to "n"/2 is to maintain "left" and "right" as a combined structure, copy only the "left" part of "m" into temporary space, and to direct the "merge" routine to place the merged output into "m". With this version it is better to allocate the temporary space outside the "merge" routine, so that only one allocation is needed. The excessive copying mentioned previously is also mitigated, since the last pair of lines before the "return result" statement (function " merge "in the pseudo code above) become superfluous. | wiki:25699928 |
Merge sort | Variants | One drawback of merge sort, when implemented on arrays, is its working memory requirement. Several in-place variants have been suggested: | wiki:25699929 |
Merge sort | Use with tape drives | An external merge sort is practical to run using disk or tape drives when the data to be sorted is too large to fit into memory. External sorting explains how merge sort is implemented with disk drives. A typical tape drive sort uses four tape drives. All I/O is sequential (except for rewinds at the end of each pass). A minimal implementation can get by with just two record buffers and a few program variables. Naming the four tape drives as A, B, C, D, with the original data on A, and using only 2 record buffers, the algorithm is similar to Bottom-up implementation, using pairs of tape drives instead of arrays in memory. | wiki:25699930 |
Merge sort | Use with tape drives | The basic algorithm can be described as follows: Instead of starting with very short runs, usually a hybrid algorithm is used, where the initial pass will read many records into memory, do an internal sort to create a long run, and then distribute those long runs onto the output set. The step avoids many early passes. For example, an internal sort of 1024 records will save nine passes. The internal sort is often large because it has such a benefit. In fact, there are techniques that can make the initial runs longer than the available internal memory. | wiki:25699931 |
Merge sort | Optimizing merge sort | On modern computers, locality of reference can be of paramount importance in software optimization, because multilevel memory hierarchies are used. Cache-aware versions of the merge sort algorithm, whose operations have been specifically chosen to minimize the movement of pages in and out of a machine's memory cache, have been proposed. For example, the algorithm stops partitioning subarrays when subarrays of size S are reached, where S is the number of data items fitting into a CPU's cache. Each of these subarrays is sorted with an in-place sorting algorithm such as insertion sort, to discourage memory swaps, and normal merge sort is then completed in the standard recursive fashion. | wiki:25699932 |
Merge sort | Optimizing merge sort | This algorithm has demonstrated better performance on machines that benefit from cache optimization. Also, many applications of external sorting use a form of merge sorting where the input get split up to a higher number of sublists, ideally to a number for which merging them still makes the currently processed set of pages fit into main memory. | wiki:25699933 |
Merge sort | Parallel merge sort | Merge sort parallelizes well due to the use of the divide-and-conquer method. Several different parallel variants of the algorithm have been developed over the years. Some parallel merge sort algorithms are strongly related to the sequential top-down merge algorithm while others have a different general structure and use the K-way merge method. | wiki:25699934 |
Merge sort | Merge sort with parallel recursion | The sequential merge sort procedure can be described in two phases, the divide phase and the merge phase. The first consists of many recursive calls that repeatedly perform the same division process until the subsequences are trivially sorted (containing one or no element). An intuitive approach is the parallelization of those recursive calls. Following pseudocode describes the merge sort with parallel recursion using the fork and join keywords: This algorithm is the trivial modification of the sequential version and does not parallelize well. Therefore, its speedup is not very impressive. It has a span of formula_2, which is only an improvement of formula_3 compared to the sequential version (see Introduction to Algorithms). | wiki:25699935 |
Merge sort | Merge sort with parallel recursion | This is mainly due to the sequential merge method, as it is the bottleneck of the parallel executions. | wiki:25699936 |
Merge sort | Merge sort with parallel merging | Better parallelism can be achieved by using a parallel merge algorithm. Cormen et al. present a binary variant that merges two sorted sub-sequences into one sorted output sequence. In one of the sequences (the longer one if unequal length), the element of the middle index is selected. Its position in the other sequence is determined in such a way that this sequence would remain sorted if this element were inserted at this position. Thus, one knows how many other elements from both sequences are smaller and the position of the selected element in the output sequence can be calculated. For the partial sequences of the smaller and larger elements created in this way, the merge algorithm is again executed in parallel until the base case of the recursion is reached. | wiki:25699937 |
Merge sort | Merge sort with parallel merging | The following pseudocode shows the modified parallel merge sort method using the parallel merge algorithm (adopted from Cormen et al.). In order to analyze a Recurrence relation for the worst case span, the recursive calls of parallelMergesort have to be incorporated only once due to their parallel execution, obtaining | wiki:25699938 |
Merge sort | Parallel multiway merge sort | It seems arbitrary to restrict the merge sort algorithms to a binary merge method, since there are usually p > 2 processors available. A better approach may be to use a K-way merge method, a generalization of binary merge, in which formula_7 sorted sequences are merged together. This merge variant is well suited to describe a sorting algorithm on a PRAM. | wiki:25699939 |
Merge sort | Basic Idea | Given an unsorted sequence of formula_8 elements, the goal is to sort the sequence with formula_9 available processors. These elements are distributed equally among all processors and sorted locally using a sequential Sorting algorithm. Hence, the sequence consists of sorted sequences formula_10 of length formula_11. For simplification let formula_8 be a multiple of formula_9, so that formula_14 for formula_15. These sequences will be used to perform a multisequence selection/splitter selection. For formula_16, the algorithm determines splitter elements formula_17 with global rank formula_18. Then the corresponding positions of formula_19 in each sequence formula_20 are determined with binary search and thus the formula_20 are further partitioned into formula_9 subsequences formula_23 with formula_24. | wiki:25699940 |
Merge sort | Basic Idea | Furthermore, the elements of formula_25 are assigned to processor formula_26, means all elements between rank formula_27 and rank formula_28, which are distributed over all formula_20. Thus, each processor receives a sequence of sorted sequences. The fact that the rank formula_7 of the splitter elements formula_31 was chosen globally, provides two important properties: On the one hand, formula_7 was chosen so that each processor can still operate on formula_33 elements after assignment. The algorithm is perfectly load-balanced. On the other hand, all elements on processor formula_26 are less than or equal to all elements on processor formula_35. Hence, each processor performs the "p"-way merge locally and thus obtains a sorted sequence from its sub-sequences. | wiki:25699941 |
Merge sort | Basic Idea | Because of the second property, no further "p"-way-merge has to be performed, the results only have to be put together in the order of the processor number. | wiki:25699942 |
Merge sort | Multisequence selection | In its simplest form, given formula_9 sorted sequences formula_10 distributed evenly on formula_9 processors and a rank formula_7, the task is to find an element formula_40 with a global rank formula_7 in the union of the sequences. Hence, this can be used to divide each formula_20 in two parts at a splitter index formula_43, where the lower part contains only elements which are smaller than formula_40, while the elements bigger than formula_40 are located in the upper part. The presented sequential algorithm returns the indices of the splits in each sequence, e.g. the indices formula_43 in sequences formula_20 such that formula_48 has a global rank less than formula_7 and formula_50. | wiki:25699943 |
Merge sort | Multisequence selection | For the complexity analysis the PRAM model is chosen. If the data is evenly distributed over all formula_9, the p-fold execution of the "binarySearch" method has a running time of formula_52. The expected recursion depth is formula_53 as in the ordinary Quickselect. Thus the overall expected running time is formula_54. Applied on the parallel multiway merge sort, this algorithm has to be invoked in parallel such that all splitter elements of rank formula_55 for formula_56 are found simultaneously. These splitter elements can then be used to partition each sequence in formula_9 parts, with the same total running time of formula_58. | wiki:25699944 |
Merge sort | Pseudocode | Below, the complete pseudocode of the parallel multiway merge sort algorithm is given. We assume that there is a barrier synchronization before and after the multisequence selection such that every processor can determine the splitting elements and the sequence partition properly. | wiki:25699945 |
Merge sort | Practical adaption and application | The multiway merge sort algorithm is very scalable through its high parallelization capability, which allows the use of many processors. This makes the algorithm a viable candidate for sorting large amounts of data, such as those processed in computer clusters. Also, since in such systems memory is usually not a limiting resource, the disadvantage of space complexity of merge sort is negligible. However, other factors become important in such systems, which are not taken into account when modelling on a PRAM. Here, the following aspects need to be considered: Memory hierarchy, when the data does not fit into the processors cache, or the communication overhead of exchanging data between processors, which could become a bottleneck when the data can no longer be accessed via the shared memory. | wiki:25699946 |
Merge sort | Practical adaption and application | Sanders et al. have presented in their paper a bulk synchronous parallel algorithm for multilevel multiway mergesort, which divides formula_9 processors into formula_66 groups of size formula_67. All processors sort locally first. Unlike single level multiway mergesort, these sequences are then partitioned into formula_66 parts and assigned to the appropriate processor groups. These steps are repeated recursively in those groups. This reduces communication and especially avoids problems with many small messages. The hierarchial structure of the underlying real network can be used to define the processor groups (e.g. racks, clusters...). | wiki:25699947 |
Merge sort | Further Variants | Merge sort was one of the first sorting algorithms where optimal speed up was achieved, with Richard Cole using a clever subsampling algorithm to ensure "O"(1) merge. Other sophisticated parallel sorting algorithms can achieve the same or better time bounds with a lower constant. For example, in 1991 David Powers described a parallelized quicksort (and a related radix sort) that can operate in "O"(log "n") time on a CRCW parallel random-access machine (PRAM) with "n" processors by performing partitioning implicitly. Powers further shows that a pipelined version of Batcher's Bitonic Mergesort at "O"((log "n")) time on a butterfly sorting network is in practice actually faster than his "O"(log "n") sorts on a PRAM, and he provides detailed discussion of the hidden overheads in comparison, radix and parallel sorting. | wiki:25699948 |
Merge sort | Comparison with other sort algorithms | Although heapsort has the same time bounds as merge sort, it requires only Θ(1) auxiliary space instead of merge sort's Θ("n"). On typical modern architectures, efficient quicksort implementations generally outperform mergesort for sorting RAM-based arrays. On the other hand, merge sort is a stable sort and is more efficient at handling slow-to-access sequential media. Merge sort is often the best choice for sorting a linked list: in this situation it is relatively easy to implement a merge sort in such a way that it requires only Θ(1) extra space, and the slow random-access performance of a linked list makes some other algorithms (such as quicksort) perform poorly, and others (such as heapsort) completely impossible. | wiki:25699949 |
Merge sort | Comparison with other sort algorithms | As of Perl 5.8, merge sort is its default sorting algorithm (it was quicksort in previous versions of Perl). In Java, the Arrays.sort() methods use merge sort or a tuned quicksort depending on the datatypes and for implementation efficiency switch to insertion sort when fewer than seven array elements are being sorted. The Linux kernel uses merge sort for its linked lists. Python uses Timsort, another tuned hybrid of merge sort and insertion sort, that has become the standard sort algorithm in Java SE 7 (for arrays of non-primitive types), on the Android platform, and in GNU Octave. | wiki:25699950 |
Maule Air | Introduction | Maule Air, Inc. is a manufacturer of light, single-engined, short take-off and landing (STOL) aircraft, based in Moultrie, Georgia, USA. The company delivered 2,500 aircraft in its first 50 years of business. | wiki:25699951 |
Maule Air | History | Belford D. Maule (1911–1995) designed his first aircraft, the M-1 starting at age 19. He founded the company Mechanical Products Co. in Napoleon, Michigan to market his own starter design. In 1941 the B.D. Maule Co. was founded, and Maule produced tailwheels and fabric testers. In 1953 he began design work, and started aircraft production with the "Bee-Dee" M-4 in 1957. The company is a family-owned enterprise. Its owner, June Maule, widow of B. D. Maule, remained directly involved with factory production until her death in 2009 at the age of 92. | wiki:25699952 |
Maule Air | Products | The aircraft produced by Maule Air are tube-and-fabric designs and are popular with bush pilots, thanks to their very low stall speed, their tundra tires and oleo strut landing gear. Most Maules are built with tailwheel or amphibious configurations, although the newer MXT models have tricycle gear. | wiki:25699953 |
Shoma Morita | Introduction | , also read as Shōma Morita, was a contemporary of Sigmund Freud and the founder of Morita therapy, a branch of clinical psychology strongly influenced by Zen Buddhism. In his capacity as the head of psychiatry for a large Tokyo hospital, Morita began developing his methods while working with sufferers of "shinkeishitsu", or anxiety disorders with a hypochondriac base. | wiki:25699954 |
Shoma Morita | Theory and methods | According to Morita, how a person feels is important as a and as an indicator for the present moment, but is uncontrollable: we don't create feelings, feelings happen to us. Since feelings do not cause our behavior, we can coexist with unpleasant feelings while still taking constructive action. The essence of Morita's method maybe summarized in three rules: Accept all your feelings, know your purpose(s), and do what needs to be done. When once asked what shy people should do, Morita replied, "Sweat." | wiki:25699955 |
Shoma Morita | Influence | David K. Reynolds, an American author, synthesized parts of Morita therapy along with the practice of Naikan into Constructive Living, an educational method intended for English-speaking Westerners. Constructive Living has since become extremely popular in Japan. Fritz Perls spent a week in a Morita Hospital in Japan. | wiki:25699956 |
Mooney | Introduction | Mooney is a family name, which is probably predominantly derived from the Irish Ó Maonaigh. It can also be spelled Moony, Moonie, Mainey, Mauney, Meaney and Meeney depending on the dialectic pronunciation that was Anglicised. | wiki:25699957 |
Mooney | Origins | The origin of the different Moony or Mooney families is lost in antiquity. The name is derived from "maoin" a Gaelic word meaning "wealth" or "treasure of treasure", hence when O'Maonaigh was anglicised to Mooney it meant "the descendant of the wealthy one." According to Irish lore, the Mooney family comes from one of the largest and most noble Irish lines. They are said to be descendants of the ancient Irish King Heremon, who, along with his brother Herber, conquered Ireland. Heremon slew his brother shortly after their invasion, took the throne for himself, and fathered a line of kings of Ireland that include Malachi II, and King Niall of the Nine Hostages. | wiki:25699958 |
Mooney | Origins | Baptismal records, parish records, ancient land grants, the Annals of the Four Masters, and books by O'Hart, McLysaght, and O'Brien were all used in researching the history of the Mooney family name. These varied and often ancient records indicate that distant septs of the name arose in several places throughout Ireland. The most known and most numerous sept came from the county of Offaly. The members of this sept were from Chieftain Monach, son of Ailill Mor, Lord of Ulster, who was descended from the Kings of Connacht. These family members gave their name to town lands called Ballymooney both in that county and in the neighbouring county of Leix. | wiki:25699959 |
Minnesota Twins | Introduction | The Minnesota Twins are an American professional baseball team based in Minneapolis, Minnesota. The Twins compete in Major League Baseball (MLB) as a member club of the American League (AL) Central Division. The team is named after the Twin Cities area which includes the two adjoining cities of Minneapolis and St. Paul. The franchise was founded in Washington, D.C. in 1901 as the Washington Senators. The team relocated to Minnesota and was renamed the "Minnesota Twins" at the start of the 1961 season. The Twins played in Metropolitan Stadium from 1961 to 1981 and in the Hubert H. Humphrey Metrodome from 1982 to 2009. | wiki:25699960 |
Minnesota Twins | Introduction | The team played its inaugural game at Target Field on April 12, 2010. The franchise won the World Series in 1924 as the Senators, and in 1987 and 1991 as the Twins. Through the 2020 season, the team has fielded 19 American League batting champions. The team has hosted five All-Star Games: 1937 and 1956 in Washington, D.C.; and 1965, 1985, and 2014 in Minneapolis-St. Paul. | wiki:25699961 |
Minnesota Twins | Washington Nationals/Senators: 1901–1960 | The team was founded in Washington, D.C. in as one of the eight original teams of the American League, named the Washington Senators from 1901 to 1904, the Washington Nationals from 1905 to 1955, and the Senators again from 1956 to 1960 but nonetheless was commonly referred to as the Senators throughout its history (and unofficially as the "Grifs" during Clark Griffith's tenure as manager from 1912 to 1920). The name "Nationals" appeared on uniforms for only two seasons, and then was replaced with the "W" logo. The media often shortened the nickname to "Nats" — even for the 1961 expansion team. | wiki:25699962 |
Minnesota Twins | Washington Nationals/Senators: 1901–1960 | The names "Nationals" and "Nats" were revived in 2005, when the Montreal Expos relocated to Washington to become the Nationals. The Washington Senators spent the first decade of their existence finishing near the bottom of the American League standings. The team's long bouts of mediocrity were immortalized in the 1955 Broadway musical "Damn Yankees". Their fortunes began to improve with the arrival of 19-year-old pitcher, Walter Johnson, in 1907. Johnson blossomed in 1911 with 25 victories, although the Senators still finished the season in seventh place. In 1912, the Senators improved dramatically, as their pitching staff led the league in team earned run average and in strikeouts. | wiki:25699963 |
Minnesota Twins | Washington Nationals/Senators: 1901–1960 | Johnson won 33 games while teammate Bob Groom added another 24 wins to help the Senators finish the season in second place. Griffith joined the team in 1912 and became the team's owner in 1920. (The franchise remained under Griffith family ownership until 1984.) The Senators continued to perform respectably in 1913 with Johnson posting a career-high 35 victories, as the team once again finished in second place. The Senators then fell into another period of decline for the next decade. The team had a period of prolonged success in the 1920s and 1930s, led by Walter Johnson, as well as additional Hall-of-Famer Bucky Harris, Goose Goslin, Sam Rice, Heinie Manush, and Joe Cronin. | wiki:25699964 |
Minnesota Twins | Washington Nationals/Senators: 1901–1960 | In particular, a rejuvenated Johnson rebounded in 1924 to win 23 games with the help of his catcher, Muddy Ruel, as the Senators won the American League pennant for the first time in the history of the franchise. The Senators then faced John McGraw's heavily favored New York Giants in the 1924 World Series. The two teams traded wins back and forth with three games of the first six being decided by one run. In the deciding 7th game, the Senators were trailing the Giants 3–1 in the 8th inning when Bucky Harris hit a routine ground ball to third which hit a pebble and took a bad hop over Giants third baseman Freddie Lindstrom. | wiki:25699965 |
Minnesota Twins | Washington Nationals/Senators: 1901–1960 | Two runners scored on the play, tying the score at three. An aging Walter Johnson then came in to pitch the ninth inning, and held the Giants scoreless into extra innings. In the bottom of the twelfth inning with Ruel at bat, he hit a high, foul ball directly over home plate. The Giants' catcher, Hank Gowdy, dropped his protective mask to field the ball but, failing to toss the mask aside, stumbled over it and dropped the ball, thus giving Ruel another chance to bat. On the next pitch, Ruel hit a double and proceeded to score the winning run when Earl McNeely hit a ground ball that took another bad hop over Lindstrom's head. | wiki:25699966 |
Minnesota Twins | Washington Nationals/Senators: 1901–1960 | This would mark the only World Series triumph for the franchise during their 60-year tenure in Washington. | wiki:25699967 |
Minnesota Twins | Minnesota Twins: 1961–present | In 1960, Major League Baseball granted the city of Minneapolis an expansion team. Washington owner Calvin Griffith, Clark's nephew and adopted son, requested that he be allowed to move his team to Minneapolis-St. Paul and instead give Washington the expansion team. Upon league approval, the team moved to Minnesota after the 1960 season, setting up shop in Metropolitan Stadium, while Washington fielded a brand new "Washington Senators" (which later became the Texas Rangers prior to the 1972 season). Success came quickly to the team in Minnesota. Sluggers Harmon Killebrew and Bob Allison, who had already been stars in Washington, were joined by Tony Oliva and Zoilo Versalles, and later second baseman Rod Carew and pitchers Jim Kaat and Jim Perry, winning the American League pennant in 1965. | wiki:25699968 |
Minnesota Twins | Minnesota Twins: 1961–present | A second wave of success came in the late 1980s and early 1990s under manager Tom Kelly, led by Kent Hrbek, Bert Blyleven, Frank Viola, and Kirby Puckett, winning the franchise's second and third World Series (and first and second in Minnesota). The name "Twins" was derived from the popular name of the region, the Twin Cities (Minneapolis and St. Paul). The NBA's Minneapolis Lakers had relocated to Los Angeles in 1960 due to poor attendance which was believed to have been caused in part by the reluctance of fans in St. Paul to support the team. Griffith was determined not to alienate fans in either city by naming the team after one city or the other, so his desire was to name the team the "Twin Cities Twins", however MLB objected. | wiki:25699969 |
Minnesota Twins | Minnesota Twins: 1961–present | Griffith therefore named the team the "Minnesota Twins". However, the team was allowed to keep its original "TC" (for Twin Cities) insignia for its caps. The team's logo shows two men, one in a Minneapolis Millers uniform and one in a St. Paul Saints uniform, shaking hands across the Mississippi River within an outline of the state of Minnesota. The "TC" remained on the Twins' caps until 1987, when they adopted new uniforms. By this time, the team felt it was established enough to put an "M" on its cap without having St. Paul fans think it stood for Minneapolis. | wiki:25699970 |
Minnesota Twins | Minnesota Twins: 1961–present | The "TC" logo was moved to a sleeve on the jerseys, and occasionally appeared as an alternate cap design. Both the "TC" and "Minnie & Paul" logos remain the team's primary insignia. As of 2010, the "TC" logo has been reinstated on the cap as their logo. | wiki:25699971 |
Minnesota Twins | 1960s | The Twins were eagerly greeted in Minnesota when they arrived in 1961. They brought a nucleus of talented players: Harmon Killebrew, Bob Allison, Camilo Pascual, Zoilo Versalles, Jim Kaat, Earl Battey, and Lenny Green. Tony Oliva, who would go on to win American League batting championships in 1964, 1965 and 1971, made his major league debut in 1962. That year, the Twins won 91 games, the most by the franchise since 1933. Behind Mudcat Grant's 21 victories, Versalles' A.L. MVP season and Oliva's batting title, the Twins won 102 games and the American League Pennant in 1965, but they were defeated in the World Series by the Los Angeles Dodgers in seven games (behind the Series MVP, Sandy Koufax, who compiled a 2–1 record, including winning the seventh game). | wiki:25699972 |
Minnesota Twins | 1960s | Heading into the final weekend of the 1967 season, when Rod Carew was named the A.L. Rookie of the Year, the Twins, Boston Red Sox, Chicago White Sox, and Detroit Tigers all had a shot at clinching the American League championship. The Twins and the Red Sox started the weekend tied for 1st place and played against each other in Boston for the final three games of the season. The Red Sox won two out of the three games, seizing their first pennant since 1946 with a 92–70 record. The Twins and Tigers both finished one game back, with 91–71 records, while the White Sox finished three games back, at 89–73. | wiki:25699973 |
Minnesota Twins | 1960s | In 1969, the new manager of the Twins, Billy Martin, pushed aggressive base running all-around, with Carew stealing home seven times in the season (1 short of Ty Cobb's Major League Record) in addition to winning the first of seven A.L. batting championships. With Killebrew slugging 49 homers and winning the AL MVP Award, these 1969 Twins won the very first American League Western Division Championship, but they lost three straight games to the Baltimore Orioles, winners of 109 games, in the first American League Championship Series. The Orioles would go on to be upset by the New York Mets in the World Series. | wiki:25699974 |
Minnesota Twins | 1960s | Martin was fired after the season, in part due to an August fight in Detroit with 20-game winner Dave Boswell and outfielder Bob Allison, in an alley outside the Lindell A.C. bar. Bill Rigney led the Twins to a repeat division title in 1970, behind the star pitching of Jim Perry (24–12), the A.L. Cy Young Award winner, while the Orioles again won the Eastern Division Championship behind the star pitching of Jim Palmer. Once again, the Orioles won the A.L. Championship Series in a three-game sweep, and this time they would win the World Series. | wiki:25699975 |
Minnesota Twins | 1970s | After winning the division again in 1970, the team entered an eight-year dry spell, finishing around the .500 mark. Killebrew departed after 1974. Owner Calvin Griffith faced financial difficulty with the start of free agency, costing the Twins the services of Lyman Bostock and Larry Hisle, who left as free agents after the 1977 season, and Carew, who was traded after the 1978 season. In 1975, Carew won his fourth consecutive AL batting title, having already joined Ty Cobb as the only players to lead the major leagues in batting average for three consecutive seasons. In , Carew batted .388, which was the highest in baseball since Boston's Ted Williams hit .406 in ; he won the 1977 AL MVP Award. | wiki:25699976 |
Minnesota Twins | 1970s | He won another batting title in 1978, hitting .333. | wiki:25699977 |
Minnesota Twins | 1980s–90s | In 1982, the Twins moved into the Hubert H. Humphrey Metrodome, which they shared with the Minnesota Vikings. After a 16–54 start, the Twins were on the verge on becoming the worst team in MLB history. They turned the season around somewhat, but still lost 102 games which is the second-worst record in Twins history (beaten only by the 2016 team, who lost 103 games), despite the .301 average, 23 homers and 92 RBI from rookie Kent Hrbek. In 1984, Griffith sold the Twins to multi-billionaire banker/financier Carl Pohlad. The Metrodome hosted the 1985 Major League Baseball All-Star Game. After several losing seasons, the 1987 team, led by Hrbek, Gary Gaetti, Frank Viola (A.L. | wiki:25699978 |
Minnesota Twins | 1980s–90s | Cy Young winner in 1988), Bert Blyleven, Jeff Reardon, Tom Brunansky, Dan Gladden, and rising star Kirby Puckett, returned to the World Series after defeating the favored Detroit Tigers in the ALCS, 4 games to 1. Tom Kelly managed the Twins to World Series victories over the St. Louis Cardinals in 1987 and the Atlanta Braves in 1991. The 1988 Twins were the first team in American League history to draw more than 3 million fans. On July 17, 1990, the Twins became the only team in major league history to pull off two triple plays in the same game. | wiki:25699979 |
Minnesota Twins | 1980s–90s | Twins' pitcher and Minnesota native Jack Morris was the star of the series in 1991, going 2–0 in his three starts with a 1.17 ERA. 1991 also marked the first time that any team that finished in last place in their division would advance to the World Series the following season; both the Twins and the Braves did this in 1991. Contributors to the 1991 Twins' improvement from 74 wins to 95 included Chuck Knoblauch, the A.L. Rookie of the Year; Scott Erickson, 20-game winner; new closer Rick Aguilera and new designated hitter Chili Davis. The World Series in 1991 is regarded by many as one of the classics of all time. | wiki:25699980 |
Minnesota Twins | 1980s–90s | In this Series, four games were won during the teams' final at-bat, and three of these were in extra innings. The Atlanta Braves won all three of their games in Atlanta, and the Twins won all four of their games in Minnesota. The sixth game was a legendary one for Puckett, who tripled in a run, made a sensational leaping catch against the wall, and finally in the 11th inning hit the game-winning home run. The seventh game was tied 0–0 after the regulation nine innings, and marked only the second time that the seventh game of the World Series had ever gone into extra innings. | wiki:25699981 |
Minnesota Twins | 1980s–90s | The Twins won on a walk-off RBI single by Gene Larkin in the bottom of the 10th inning, after Morris had pitched ten shutout innings against the Braves. The seventh game of the 1991 World Series is widely regarded as one of the greatest games in the history of professional baseball. After a winning season in 1992 but falling short of Oakland in the division, the Twins fell into a years-long stretch of mediocrity, posting a losing record each season for the next eight: 71–91 in 1993, 50–63 in 1994, 56–88 in 1995, 78–84 in 1996, 68–94 in 1997, 70–92 in 1998, 63–97 in 1999 and 69–93 in 2000. | wiki:25699982 |
Minnesota Twins | 1980s–90s | From 1994 to 1997, a long sequence of retirements and injuries hurt the team badly, and Tom Kelly spent the remainder of his managerial career attempting to rebuild the Twins. In 1997, owner Carl Pohlad almost sold the Twins to North Carolina businessman Don Beaver, who would have moved the team to the Piedmont Triad area. | wiki:25699983 |
Minnesota Twins | 2000s | The Twins dominated the Central Division in the first decade of the new century, winning the division in six of those ten years ('02, '03, '04, '06, '09 and '10), and nearly winning it in '08 as well. From 2001 to 2006, the Twins compiled the longest streak of consecutive winning seasons since moving to Minnesota. Threatened with closure by league contraction, the 2002 team battled back to reach the American League Championship Series before being eliminated 4–1 by that year's World Series champion Anaheim Angels. The Twins have not won a playoff series since the 2002 series against the Athletics, this despite the team winning several division championships in the decade. | wiki:25699984 |
Minnesota Twins | 2006 | In 2006, the Twins won the division on the last day of the regular season (the only day all season they held sole possession of first place) but lost to the Oakland Athletics in the ALDS. Ozzie Guillén coined a nickname for this squad, calling the Twins "little piranhas". The Twins players embraced the label, and in response, the Twins Front office started a "Piranha Night", with piranha finger puppets given out to the first 10,000 fans. Scoreboard operators sometimes played an animated sequence of piranhas munching under that caption in situations where the Twins were scoring runs playing "small ball", and the stadium vendors sold T-shirts and hats advertising "The Little Piranhas". | wiki:25699985 |
Minnesota Twins | 2006 | The Twins also had the AL MVP in Justin Morneau, the AL batting champion in Joe Mauer, and the AL Cy Young Award winner in Johan Santana. | wiki:25699986 |
Minnesota Twins | 2008 | In 2008, the Twins finished the regular season tied with the White Sox on top of the AL Central, forcing a one-game playoff in Chicago to determine the division champion. The Twins lost that game and missed the playoffs. The game location was determined by rule of a coin flip that was conducted in mid-September. This rule was changed for the start of the 2009 season, making the site for any tiebreaker game to be determined by the winner of the regular season head-to-head record between the teams involved. | wiki:25699987 |
Minnesota Twins | 2009 | After a year where the Twins played .500 baseball for most of the season, the team won 17 of their last 21 games to tie the Detroit Tigers for the lead in the Central Division. The Twins were able to use the play-in game rule to their advantage when they won the AL Central at the end of the regular season by way of a 6–5 tiebreaker game that concluded with a 12th-inning walk-off hit by Alexi Casilla to right field, that scored Carlos Gómez. However, they failed to advance to the American League Championship Series as they lost the American League Divisional Series in three straight games to the eventual World Series champion New York Yankees. | wiki:25699988 |
Minnesota Twins | 2009 | That year, Joe Mauer became only the second catcher in 33 years to win the AL MVP award. Iván Rodríguez won for the Texas Rangers in 1999, previous to that, the last catcher to win an AL MVP was the New York Yankees Thurman Munson in 1976. | wiki:25699989 |
Minnesota Twins | 2010 | In their inaugural season played at Target Field, the Twins finished the regular season with a record of 94–68, clinching the AL Central Division title for the 6th time in 9 years under manager Ron Gardenhire. New regular players included rookie Danny Valencia at third base, designated hitter Jim Thome, closer Matt Capps, infielder J. J. Hardy, and infielder Orlando Hudson. In relief pitching roles were late additions Brian Fuentes and Randy Flores. On July 7, the team suffered a major blow when Justin Morneau sustained a concussion, which knocked him out for the rest of the season. In the divisional series, the Twins lost to the Yankees in a three-game sweep for the second consecutive year. | wiki:25699990 |
Minnesota Twins | 2010 | Following the season, Ron Gardenhire received AL Manager of the Year honors after finishing as a runner up in several prior years. | wiki:25699991 |
Minnesota Twins | 2011 | After repeating as AL Central champions in 2010, the Twins entered 2011 with no players on the disabled list, and the team seemed poised for another strong season. During the off-season, the team signed Japanese shortstop Tsuyoshi Nishioka to fill a hole in the middle infield, re-signed Jim Thome, who was in pursuit of career home run number 600, and also re-signed Carl Pavano. However, the season was largely derailed by an extensive list of injuries. Nishioka's broken leg in a collision at second base led the way and was followed by DL stints from Kevin Slowey, Joe Mauer, Jason Repko, Thome, Delmon Young (two stints on the DL), José Mijares, Glen Perkins, Joe Nathan, Francisco Liriano, Jason Kubel, Denard Span (two stints), Justin Morneau, Scott Baker, and Alexi Casilla. | wiki:25699992 |
Minnesota Twins | 2011 | The team's low point was arguably on May 1 when the team started 7 players who were batting below .235 in a game against Kansas City. From that day forward, the Twins made a strong push to get as close as five games back of the division lead by the All-Star break. However, the team struggled down the stretch and fell back out of contention. The team failed to reach the playoffs for the first time since 2008 and experienced their first losing season in four years. Despite an AL-worst 63–99 record, the team drew over 3 million fans for the second consecutive year. | wiki:25699993 |
Minnesota Twins | 2011 | Michael Cuddyer served as the Twins representative at the All-Star game, his first appearance. Bert Blyleven's number was retired during the season and he was also inducted into the Baseball Hall of Fame during the month of July. On August 10, Nathan recorded his 255th save, passing Rick Aguilera for first place on the franchise's all-time saves list. On August 15, Thome hit 599th and 600th home run at Comerica Park to become the eighth player in Major League history to hit 600 home runs, joining Babe Ruth, Willie Mays, Hank Aaron, Barry Bonds, Sammy Sosa, Ken Griffey, Jr., and Alex Rodriguez. | wiki:25699994 |
Minnesota Twins | 2012–2016 | The team started the 2012 season with a league worst 10–24 record. In late May and early June, the team embarked on a hot streak, winning 10 out of 13 games. By mid July, the team found themselves only 10 games out of the division lead. On July 16, the Twins defeated the Baltimore Orioles 19–7, the most runs scored in the short history of Target Field. By the end of August, the Twins were more than 20 games below .500, and last in the American League. On August 29, it was announced that the Twins would host the 2014 All-Star Game. | wiki:25699995 |
Minnesota Twins | 2012–2016 | In 2013, the Twins finished in 4th place in the AL Central, with a record of 66–96. In 2014, the team finished with a 70–92 record, last in the division and accumulated the second fewest wins in the American League. As a result, Ron Gardenhire was fired on September 29, 2014. On November 3, 2014 Paul Molitor was announced by the team as the 13th manager in Twins history. In 2015, the team had a winning season (83–79), following four consecutive seasons of 90 or more losses. In 2016, the Minnesota Twins finished last in the AL Central, with a 59–103 record. | wiki:25699996 |
Minnesota Twins | 2012–2016 | Brian Dozier set his career high in home runs with 43, which was tied for second in baseball, and leading all 2nd basemen. Tyler Duffey led all Twins starters with 9 wins throughout the season, while fellow reliever Brandon Kintzler led the team with 17 saves. Rising stars Miguel Sanó, Max Kepler, and Byron Buxton combined to have 263 total hits, 52 home runs, 167 RBIs, and a batting average of .232 throughout the season. The Twins signed star Korean slugger Byung Ho Park to a 4-year/$12 million contract, where he hit a .191 batting average, with 12 home runs, and 24 RBIs before being sent down to Rochester for the remainder of the season. | wiki:25699997 |
Minnesota Twins | 2017 and 2018 | In 2017, the Twins went 85–77, finishing 2nd In the AL Central. Following Brian Dozier's 34 home runs, Miguel Sanó, Byron Buxton, and Eddie Rosario all had breakout years, while Joe Mauer hit .305. They ended up making the playoffs, which made them the first ever team to lose 100 games the previous year and make the playoffs the next season. They lost to the Yankees in the wild card round. The 2018 season did not go as well. The Twins went 78–84, and did not return to the post-season. Sanó and Buxton were injured most of the year and eventually both sent down to the minors, while long-time Twin Brian Dozier was traded at the deadline. | wiki:25699998 |
Minnesota Twins | 2017 and 2018 | One bright spot came at the end of the season, when hometown hero Joe Mauer returned to catcher (his original position) for his final game, ending his career with a signature double and standing ovation. Another highlight was the team's two-game series against the Cleveland Indians in San Juan, Puerto Rico. After the season, manager Paul Molitor was fired. Free agent signing Logan Morrison and long-time veteran Ervin Santana declared free agency. | wiki:25699999 |
Minnesota Twins | 2019 | During the 2019 off-season, the Twins hired Rocco Baldelli as their new manager, signed free agents Marwin González, Jonathan Schoop, Nelson Cruz, and claimed CJ Cron off of waivers from the Tampa Bay Rays. Cron had 30 homeruns in the 2018 season. They also signed Martín Pérez, Ronald Torreyes, and Blake Parker. Third baseman Miguel Sanó had surgery on his achilles tendon in March and did not return until May. The Twins started the 2019 MLB season hot, owning the best record in baseball through mid-May. The strong start however did not translate to strong attendance, as they had the largest attendance drop in baseball during the first month of the season, with bad weather also being a factor. | wiki:25700000 |